Abstract

There is always a need for the compression of data to facilitate its easy transmission and storage. Several lossy and lossless techniques have been developed in the past few decades. Lossless techniques allow compression without any loss of information. In this paper, we propose a new algorithm for lossless compression. Our experimental results show that the proposed algorithm performs compression in lesser iterations than the existing Non-Binary Huffman coding without affecting the average number of digits required to represent the symbols, thereby reducing the complexity involved during the compression process.