An efficient finite-state machine implementation of Huffman decoders

DOI10.1016/S0020-0190(97)00176-2MaRDI QIDQ293146zbMATH OpenFDO

Authors Vikram Iyengar, Krishnendu Chakrabarty

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/S0020019097001762?np=y

zbMATH Keywords

information retrievaldecoding methodshardware implementationHuffman codes

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 522438 (Why is no real title available?)
• Efficient Huffman decoding
• Huffman coding in bit-vector compression

Cited in

(4)

• Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders
• Generation of fast interpreters for Huffman compressed bytecode
• Research and implementation of a decoder of 1-wire bus
• Parallel Huffman Decoding with Applications to JPEG Files

This page was built for publication: 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 Q293146)