scientific article; zbMATH DE number 436071

MaRDI QIDQ3139856zbMATH OpenFDO

Authors David R. McIntyre, Francis G. Wolff

Publication date 11 November 1993

zbMATH Keywords

data compressionstorageHuffman tree

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 1439476
• scientific article; zbMATH DE number 1091469
• scientific article; zbMATH DE number 2170434
• Level-compressed Huffman decoding
• Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)

Cited in

(12)

• Optimal skeleton Huffman trees
• Optimal skeleton and reduced Huffman trees
• An efficient bitwise Huffman coding technique based on source mapping.
• Bidirectional Huffman coding
• Generation of fast interpreters for Huffman compressed bytecode
• Effect of file size, entropy and alphabet size on Huffman algorithm performance
• Huffman coding in bit-vector compression
• Constructing binary Huffman tree
• Fast tabular decoding method for multi-delimiter codes
• scientific article; zbMATH DE number 2170434 (Why is no real title available?)
• Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)
• A space-efficient Huffman decoding algorithm and its parallelism

This page was built for publication:

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