Level-compressed Huffman decoding

IEEE Transactions on Communications

Volumn 47, Issue 10, 1999, Pages 1455-1457

  Chung, Kuo Liang ^a   Wu, Jung Gen ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DECODING; TREES (MATHEMATICS);

HUFFMAN DECODING; HUFFMAN TREE;

DATA COMPRESSION;

EID: 0033354210     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.795810     Document Type: Article

References (8)

1. T. C. Bell, J. G. Cleary, and I. H. Witten, Text Compression. Englewood Cliffs, NJ: Prentice-Hall, 1990, pp. 105-107, sec. 5.1.2.
2. K. L. Chung and Y. K. Lin, "A novel memory-efficient Huffman decoding algorithm and its implementation," Signal Processing, vol. 62, pp. 207-213, 1997.
3. K. L. Chung, "Efficient Huffman decoding," Inf. Process. Lett., vol. 61, pp. 97-99, 1997.
4. R. Hashemian, "Memory efficient and high-speed search Huffman coding," IEEE Trans. Commun., vol. 43, pp. 2576-2581, Oct. 1995.
5. A. Huffman, "A method for the construction of minimum redundancy codes," Proc. IRE, vol. 40, pp. 1098-1101, Sept. 1952.
6. A. Moffat and A. Turpin, "On the implementation of minimum redundancy prefix codes," IEEE Trans. Commun., vol. 45, pp. 1200-1207, Oct. 1997.
7. B. M. E. Moret and H. D. Shapiro, Algorithms from P to NP, vol. 1, Design and Efficiency. New York: Benjamin, 1991, pp. 193-196, sec. 4.1.1.
8. E. S. Schwartz and B. Kallick, "Generating a canonical prefix encoding," Commun. ACM, vol. 7, pp. 166-169, 1964.