On the Implementation of Minimum Redundancy Prefix Codes (1997) 计算机科学

1200 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 45, NO. 10, OCTOBER 1997On the Implementation of Minimum Redundancy Prefix CodesAlistair Moffat and Andrew TurpinAbstract—Minimum redundancy coding (also known as Huff- man coding) is one of the enduring techniques of data compres- sion. Many efforts have been made to improve the efficiency of minimum redundancy coding, the majority based on the use of improved representations for explicit Huffman trees. In this paper, we examine how minimum redunda