Efficient Huffman decoding

DOI10.1016/S0020-0190(96)00204-9MaRDI QIDQ286977zbMATH OpenFDO

Authors Kuo-Liang Chung

Publication date 26 May 2016

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

zbMATH Keywords

data structuresdecoding algorithmsHuffman code

Mathematics Subject Classification ID

Data structures (68P05) Decoding (94B35)

Cites work

• scientific article; zbMATH DE number 53946 (Why is no real title available?)
• scientific article; zbMATH DE number 108383 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• Memory efficient and high-speed search Huffman coding

Cited in

(9)

• A space-efficient Huffman decoding algorithm and its parallelism
• An efficient finite-state machine implementation of Huffman decoders
• Fixed-prefix encoding of the integers can be Huffman-optimal
• An improved algorithm for solving the banded cyclic string-to-string correction problem
• An efficient decoding technique for Huffman codes
• scientific article; zbMATH DE number 1066966 (Why is no real title available?)
• An efficient bitwise Huffman coding technique based on source mapping.
• Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders
• A memory-efficient and fast Huffman decoding algorithm

This page was built for publication: Efficient Huffman decoding

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