An Innovative Idea to Represent Tree in the Huffman Data Compression Algorithm

The Huffman tree has to be developed before data compression and decompression in the Huffman data compression algorithm. The sender has to send tree information to the receiver separately to decompress the data. As a result, the bandwidth of the network was wasted and the complexity of the algorithm increased in both the cases, i.e., time and space. In this paper, an effort has been made to improve the efficiency of data compression in the Huffman data compression technique. The Huffman tree is represented by strings of 0s and 1s. The information to develop the Huffman tree is sent with the compressed data as a string of characters without any flag/separator to distinguish the end of the represented tree and the compressed data. A comparison is made between the proposed method and the existing technique to compress the same data. Finally, it is observed that the proposed method is more efficient than the existing method in representing a tree in the Huffman data compression algorithm