An efficient decoding technique for Huffman codes

DOI10.1016/S0020-0190(01)00243-5zbMath1013.68067OpenAlexW2103247055MaRDI QIDQ1603588

Irwin King, Rezaul Alam Chowdhury, Mohammad Kaykobad

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00243-5

zbMATH Keywords

data structurescomplete binary treestatic Huffman code

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Space-efficient Huffman codes revisited

Cites Work

• Efficient Huffman decoding
• A memory-efficient and fast Huffman decoding algorithm
• Memory efficient and high-speed search Huffman coding
• Design and analysis of dynamic Huffman codes
• Huffman codes and self-information
• The length of a typical Huffman codeword
• A Method for the Construction of Minimum-Redundancy Codes