A memory-efficient and fast Huffman decoding algorithm

DOI10.1016/S0020-0190(99)00002-2zbMath1338.68050WikidataQ126572628 ScholiaQ126572628MaRDI QIDQ294633

Hong-Chung Chen, Yue-Li Wang, Yu-Feng Lan

Publication date: 16 June 2016

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019099000022?np=y

zbMATH Keywords

data structuresdecoding algorithmHuffman code

Mathematics Subject Classification ID

Data structures (68P05) Decoding (94B35)

Related Items (1)

An efficient decoding technique for Huffman codes

Cites Work

• Efficient Huffman decoding
• Memory efficient and high-speed search Huffman coding
• Self-synchronizing Huffman codes (Corresp.)
• A Method for the Construction of Minimum-Redundancy Codes

This page was built for publication: A memory-efficient and fast Huffman decoding algorithm