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

DOI10.1016/S0020-0190(98)00136-7zbMATH Open1339.68059OpenAlexW2063833950MaRDI QIDQ293392FDOQ293392

Authors: Andrew Turpin, Alistair Moffat 

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

Recommendations

• An efficient finite-state machine implementation of Huffman decoders
• Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)
• scientific article; zbMATH DE number 2170434
• A novel memory-efficient Huffman decoding algorithm and its implementation
• scientific article; zbMATH DE number 1439476

zbMATH Keywords

data structuresdesign of algorithmsHuffman coding

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Efficient Huffman decoding
• A Method for the Construction of Minimum-Redundancy Codes
• 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

Cited In (2)

• An efficient finite-state machine implementation of Huffman decoders
• Remark on ``Algorithm 673: Dynamic Huffman coding

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293392)