An efficient Huffman encoding algorithm based on multi-level and look-up table

MaRDI QIDQ4901849zbMATH OpenFDO

Authors Li-Ying Hu, Lu Lin

Publication date 24 January 2013

zbMATH Keywords

data compressiondigital signal processorHuffman codelook-up table

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• A novel memory-efficient Huffman decoding algorithm and its implementation
• An efficient coding and decoding algorithm based on generalized Huffman tree
• Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)
• A memory-efficient and fast Huffman decoding algorithm
• Memory efficient and high-speed search Huffman coding

Cited in

(3)

• A memory-efficient and fast Huffman decoding algorithm
• Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)
• An efficient coding and decoding algorithm based on generalized Huffman tree

This page was built for publication: An efficient Huffman encoding algorithm based on multi-level and look-up table

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