Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders

DOI10.1016/S0020-0190(98)00136-7zbMath1339.68059OpenAlexW2063833950MaRDI QIDQ293392

Alistair Moffat, Andrew Turpin

Publication date: 9 June 2016

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

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

zbMATH Keywords

data structuresdesign of algorithmsHuffman coding

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Decoding (94B35)

Cites Work

• Unnamed Item
• Efficient Huffman decoding
• An efficient finite-state machine implementation of Huffman decoders
• Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)
• Generating a canonical prefix encoding
• A Method for the Construction of Minimum-Redundancy Codes

This page was built for publication: Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders