Dynamic huffman coding

DOI10.1016/0196-6774(85)90036-7MaRDI QIDQ3745760zbMATH OpenOpenAlexFDO

Authors Donald E. Knuth

Publication date 1985

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(85)90036-7

zbMATH Keywords

prefix codeHuffman treefile compressionweighted path lengthOne-pass algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Prefix, length-variable, comma-free codes (94A45) Data structures (68P05)

Recommendations

• Design and analysis of dynamic Huffman codes
• Algorithm 673
• In-place calculation of minimum-redundancy codes
• Forward looking Huffman coding
• Forward looking Huffman coding

Cited in

(31)

• Is Huffmann coding dead?
• Design and analysis of dynamic Huffman codes
• Simple worst-case optimal adaptive prefix-free coding
• Old and new results on alphabetic codes
• Worst-Case Optimal Adaptive Prefix Coding
• Dynamic Re-Encoding During MDD Minimization
• Dynamic Shannon coding
• Binary Huff Curves
• Parity codes
• Dynamic Trees with Almost-Optimal Access Cost
• Inference for conditioned Galton-Watson trees from their Harris path
• Forward looking Huffman coding
• Exact and approximation algorithms for error-detecting even codes
• Huffman coding with non-sorted frequencies
• Optimal binary search trees
• Synchronizing dynamic Huffman codes
• The \(S\)-digraph optimization problem and the greedy algorithm
• A fast algorithm for adaptive prefix coding
• Block Huffman coding
• Online learning over a finite action set with limited switching
• A fast dynamic compression scheme for natural language texts
• Minimax trees in linear time with applications
• Weighted forward looking adaptive coding
• Housekeeping for prefix coding
• Remark on ``Algorithm 673: Dynamic Huffman coding
• Forward looking Huffman coding
• A fast and efficient nearly-optimal adaptive Fano coding scheme
• Efficient algorithms for online decision problems
• Lossless image compression based on multiple-tables arithmetic coding
• A novel lossless data compression scheme based on the error correcting Hamming codes
• An adaptive character wordlength algorithm for data compression

This page was built for publication: Dynamic huffman coding

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