Memory efficient and high-speed search Huffman coding

DOI10.1109/26.469442MaRDI QIDQ2726185zbMATH OpenOpenAlexFDO

Authors Reza Hashemian

Publication date 7 February 2002

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/26.469442

zbMATH Keywords

code compressionHuffman coding

Mathematics Subject Classification ID

Data structures (68P05) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• A novel memory-efficient Huffman decoding algorithm and its implementation
• A memory-efficient and fast Huffman decoding algorithm
• An efficient coding and decoding algorithm based on generalized Huffman tree
• Level-compressed Huffman decoding
• A space-efficient Huffman decoding algorithm and its parallelism

Cited in

(10)

• Huffman coding in bit-vector compression
• A space-efficient Huffman decoding algorithm and its parallelism
• An efficient decoding technique for Huffman codes
• Space-efficient Huffman codes revisited
• Memory-Efficient Algorithms for Finding Needles in Haystacks
• Efficient Huffman decoding
• A memory-efficient and fast Huffman decoding algorithm
• An efficient coding and decoding algorithm based on generalized Huffman tree
• Optimal synchronous coding
• An efficient Huffman encoding algorithm based on multi-level and look-up table

This page was built for publication: Memory efficient and high-speed search Huffman coding

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