Is Huffmann coding dead?

DOI10.1007/BF02243872MaRDI QIDQ685866zbMATH OpenFDO

Authors A. Bookstein, Shmuel T. Klein

Publication date 20 December 1993

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02243872

zbMATH Keywords

data compressionHuffman codestext compressionarithmetic codescooling theoryinformation storage

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)

Recommendations

• Arithmetic coding with folds and unfolds
• scientific article; zbMATH DE number 2036351
• Huffman coding in bit-vector compression
• On the competitive optimality of Huffman codes
• A note on the competitive optimality of the Huffman code

Cites work

• scientific article; zbMATH DE number 3117092 (Why is no real title available?)
• scientific article; zbMATH DE number 3738962 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3558968 (Why is no real title available?)
• scientific article; zbMATH DE number 3435047 (Why is no real title available?)
• scientific article; zbMATH DE number 781546 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• A fast algorithm for optimal length-limited Huffman codes
• A universal algorithm for sequential data compression
• Arithmetic Coding
• Arithmetic coding into fixed-length codewords
• Bidirectional Huffman coding
• Bounding the depth of search trees
• Bounds on the redundancy of Huffman codes (Corresp.)
• Codes based on inaccurate source probabilities
• Compression of individual sequences via variable-rate coding
• Data compression
• Design and analysis of dynamic Huffman codes
• Dynamic huffman coding
• Generalized Kraft Inequality and Arithmetic Coding
• Generating a canonical prefix encoding
• Huffman coding in bit-vector compression
• New bounds on the redundancy of Huffman codes
• Self-synchronizing Huffman codes (Corresp.)
• Universal codeword sets and representations of the integers
• Variations on a theme by Huffman

Cited in

(3)

• Integrated encryption in dynamic arithmetic compression
• Robust universal complete codes for transmission and compression
• Dense non-binary Fibonacci codes

This page was built for publication: Is Huffmann coding dead?

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