Level-compressed Huffman decoding

DOI10.1109/26.795810MaRDI QIDQ2732764zbMATH OpenOpenAlexFDO

Authors Kuo-Liang Chung, Jung-Gen Wu

Publication date 4 September 2001

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

Full work available at URL https://semanticscholar.org/paper/1a6667b632e224fe894c0148dc781842a674ed66

zbMATH Keywords

array data structuredata compressiondecoding algorithmHuffman tree

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
• scientific article; zbMATH DE number 2170434
• An efficient decoding technique for Huffman codes
• scientific article; zbMATH DE number 1439476
• A space-efficient Huffman decoding algorithm and its parallelism

Cited in

(7)

• A novel memory-efficient Huffman decoding algorithm and its implementation
• An efficient decoding technique for Huffman codes
• Memory efficient and high-speed search Huffman coding
• An efficient coding and decoding algorithm based on generalized Huffman tree
• scientific article; zbMATH DE number 436071 (Why is no real title available?)
• scientific article; zbMATH DE number 2170434 (Why is no real title available?)
• scientific article; zbMATH DE number 1439476 (Why is no real title available?)

This page was built for publication: Level-compressed Huffman decoding

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