A memory-efficient and fast Huffman decoding algorithm

DOI10.1016/S0020-0190(99)00002-2zbMATH Open1338.68050WikidataQ126572628 ScholiaQ126572628MaRDI QIDQ294633FDOQ294633

Authors: Hong-Chung Chen, Yue-Li Wang, Yu-Feng Lan 

Publication date: 16 June 2016

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

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

Recommendations

• A novel memory-efficient Huffman decoding algorithm and its implementation
• A space-efficient Huffman decoding algorithm and its parallelism
• An efficient Huffman encoding algorithm based on multi-level and look-up table
• An efficient decoding technique for Huffman codes
• scientific article; zbMATH DE number 1439476

zbMATH Keywords

data structuresHuffman codedecoding algorithm

Mathematics Subject Classification ID

Data structures (68P05) Decoding (94B35)

Cites Work

• Memory efficient and high-speed search Huffman coding
• Efficient Huffman decoding
• A Method for the Construction of Minimum-Redundancy Codes
• Self-synchronizing Huffman codes (Corresp.)

Cited In (9)

• An efficient Huffman encoding algorithm based on multi-level and look-up table
• An efficient bitwise Huffman coding technique based on source mapping.
• An efficient decoding technique for Huffman codes
• An efficient coding and decoding algorithm based on generalized Huffman tree
• Title not available (Why is that?)
• The efficient decoding of multi-delimiter code \(C_{2,3,5}\).
• Generation of fast interpreters for Huffman compressed bytecode
• Memory efficient and high-speed search Huffman coding
• A space-efficient Huffman decoding algorithm and its parallelism

This page was built for publication: A memory-efficient and fast Huffman decoding algorithm

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