A novel memory-efficient Huffman decoding algorithm and its implementation

DOI10.1016/S0165-1684(97)00125-4MaRDI QIDQ1127298zbMATH OpenFDO

Authors S. H. Smith

Publication date 13 August 1998

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0165-1684(97)00125-4

zbMATH Keywords

data structuredecoding algorithmHuffman codeimage compression

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Source coding (94A29) Decoding (94B35)

Recommendations

• A memory-efficient and fast Huffman decoding algorithm
• A space-efficient Huffman decoding algorithm and its parallelism
• Level-compressed Huffman decoding
• An efficient decoding technique for Huffman codes

Cited in

(14)

• An efficient bitwise Huffman coding technique based on source mapping.
• A space-efficient Huffman decoding algorithm and its parallelism
• An efficient decoding technique for Huffman codes
• Memory efficient and high-speed search Huffman coding
• Level-compressed Huffman decoding
• An efficient finite-state machine implementation of Huffman decoders
• Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders
• A memory-efficient and fast Huffman decoding algorithm
• Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)
• An efficient coding and decoding algorithm based on generalized Huffman tree
• Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
• An efficient Huffman encoding algorithm based on multi-level and look-up table
• scientific article; zbMATH DE number 1439476 (Why is no real title available?)
• The efficient decoding of multi-delimiter code \(C_{2,3,5}\).

This page was built for publication: A novel memory-efficient Huffman decoding algorithm and its implementation

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