An efficient coding and decoding algorithm based on generalized Huffman tree

MaRDI QIDQ3054159zbMATH OpenFDO

Authors Jianguang Guo, W. J. Zhang, Jian Yang, Wentao An, Tao Xiong

Publication date 5 November 2010

zbMATH Keywords

balanced codinggeneralized Huffman treeHuffman codinglossless data compression

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Decoding (94B35)

Recommendations

• A novel memory-efficient Huffman decoding algorithm and its implementation
• Memory efficient and high-speed search Huffman coding
• An efficient Huffman encoding algorithm based on multi-level and look-up table
• A memory-efficient and fast Huffman decoding algorithm
• Level-compressed Huffman decoding

Cited in

(6)

• An efficient bitwise Huffman coding technique based on source mapping.
• An efficient decoding technique for Huffman codes
• Generalized Huffman coding for binary trees with choosable edge lengths
• Generalized Huffman tree and its application in Chinese character coding
• Memory efficient and high-speed search Huffman coding
• An efficient Huffman encoding algorithm based on multi-level and look-up table

This page was built for publication: An efficient coding and decoding algorithm based on generalized Huffman tree

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