Is Huffmann coding dead?

DOI10.1007/BF02243872zbMath0780.94003MaRDI QIDQ685866

Shmuel T. Klein, Abraham Bookstein

Publication date: 20 December 1993

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

data compressiontext compressionHuffman codesarithmetic codescooling theoryinformation storage

Mathematics Subject Classification ID

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

Related Items (2)

Robust universal complete codes for transmission and compression ⋮ Integrated encryption in dynamic arithmetic compression

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Huffman coding in bit-vector compression
• Self-synchronizing Huffman codes (Corresp.)
• New bounds on the redundancy of Huffman codes
• A fast algorithm for optimal length-limited Huffman codes
• Dynamic huffman coding
• Bounds on the redundancy of Huffman codes (Corresp.)
• Design and analysis of dynamic Huffman codes
• Data compression
• Universal codeword sets and representations of the integers
• Generalized Kraft Inequality and Arithmetic Coding
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Variations on a theme by Huffman
• Arithmetic Coding
• Arithmetic coding into fixed-length codewords
• Bidirectional Huffman Coding
• Bounding the Depth of Search Trees
• Generating a canonical prefix encoding
• A Method for the Construction of Minimum-Redundancy Codes
• Codes based on inaccurate source probabilities

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