An efficient decoding technique for Huffman codes

Information Processing Letters

Volumn 81, Issue 6, 2002, Pages 305-308

  Chowdhury, Rezaul Alam ^a   Kaykobad, M ^a   King, Irwin ^b  

^a BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Complete binary tree; Data structures; Static Huffman code

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DECODING; THEOREM PROVING;

STATIC HUFFMAN CODES;

CODES (SYMBOLS);

EID: 0037204522     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00243-5     Document Type: Article

References (8)

1. A memory-efficient and fast Huffman decoding algorithm
2. Efficient Huffman decoding
3. Memory efficient and high-speed search Huffman coding
4. A method for construction of minimum redundancy codes
5. Huffman codes and self-information
6. The length of a typical Huffman codeword
7. Design and analysis of dynamic Huffman codes