Memory efficient and high-speed search Huffman coding

DOI10.1109/26.469442zbMath0978.94514OpenAlexW2129503320MaRDI QIDQ2726185

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

Huffman codingcode compression

Mathematics Subject Classification ID

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

Related Items (6)

Efficient Huffman decoding ⋮ A memory-efficient and fast Huffman decoding algorithm ⋮ Optimal synchronous coding ⋮ A space-efficient Huffman decoding algorithm and its parallelism ⋮ Space-efficient Huffman codes revisited ⋮ An efficient decoding technique for Huffman codes

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