Efficient Huffman decoding

Information Processing Letters

Volumn 61, Issue 2, 1997, Pages 97-99

  Chung, Kuo Liang ^a  

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

Author keywords

Data structures; Decoding algorithms; Huffman code

Indexed keywords

EID: 0007758265     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(96)00204-9     Document Type: Article

References (8)

1. T.C. Bell, J.G. Cleary and I.H. Witten, Text Compression (Prentice Hall, Englewood Cliffs, NJ, 1990).
2. K.L. Chung and C.J. Wu, A fast search algorithm on modified S-trees, Pattern Recognition Lett. 16 (1995) 1159-1164.
3. K.L. Chung and Y.K. Lin, A novel memory-efficient and fast Huffman decoding algorithm, Research Kept., Dept. of Information Management, National Taiwan Institute of Technology, 1996.
4. R. Hashemian, Memory efficient and high-speed search Huffman coding, IEEE Trans. Commun. 43 (1995) 2576-2581.
5. E. Horowitz, S. Sahni and S. Andersonfreed, Fundamentals of Data Structures in C (New York, 1993) 201.
6. A. Huffman, A method for the construction of minimum redundancy codes, in: Proc. IRE 40 (1952) 1098-1101.
7. W.B. Pennebaker and J.L. Mitchell, JPEG: Still Image Data Compression Standard (New York, 1993).
8. S. Roman, Coding and Information Theory (Springer, New York, 1992).