IEEE Transactions on Communications · 1999 · 16 citations · 6 references
ComputingComputer ScienceAlgorithmsComputer ArchitectureData StructuresCoding TheoryData CompressionBreadth-first SearchCompressed Data StructuresCompressionCompression AlgorithmsDecoding AlgorithmsDecoding ComplexityDepth-first SearchHuffman Coding
Based on the breadth-first search manner and the level-compression technique, this article first presents a new array data structure to represent the classical Huffman (1952) tree. Then, the decoding algorithm is given. Both the memory and the decoding time required in the proposed method are less than those of previous methods. Some experimentations are carried out to demonstrate the advantages of the proposed method. In fact, the proposed algorithm can be applied to the canonical Huffman tree.
6
Generating a canonical prefix encoding
Eugene S. Schwartz, Bruce Kallick · Communications of the ACM · 1964 · 130 citations · Full text
Chung Kuo-Liang · Information Processing Letters · 1997 · 25 citations