A new approach of a memory efficient huffman tree representation technique

Huffman compression is a very efficient and effective technique in the field of data compression. It can be more efficient by reducing the memory requirements for Huffman tree. This paper focuses on reducing the size of the tree of Huffman coding and also presents a memory efficient technique to store the Huffman tree where in addition to storing symbols, extra bits are stored to represent tree structure resulting total memory requirements for Huffman tree which are ⌞10.75n−3⌟ bits at worst case and 9n bits at best case where n is the number of symbols. The proposed tree representation technique would be prodigiously efficient among all existing techniques not only for its less memory utilization but also removing crucial limitations of previous works. The proposed memory efficient technique of Huffman tree uses some new terms such as “circular leaf node”, “node with 2 internal son nodes”, and also given some new conception of “upper leaf node” , “external limb”, “internal limb”, and “antenna limb”.