Dynamic huffman coding

DOI10.1016/0196-6774(85)90036-7zbMath0606.94007MaRDI QIDQ3745760

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 code; Huffman tree; file compression; weighted path length; One-pass algorithms

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68P05: Data structures

94A45: Prefix, length-variable, comma-free codes

Related Items

Parity codes, Online Learning over a Finite Action Set with Limited Switching, Dynamic Trees with Almost-Optimal Access Cost, Optimal binary search trees, Forward looking Huffman coding, Inference for conditioned Galton-Watson trees from their Harris path, Exact and approximation algorithms for error-detecting even codes, A fast dynamic compression scheme for natural language texts, Is Huffmann coding dead?, Dynamic Shannon coding, An adaptive character wordlength algorithm for data compression, A novel lossless data compression scheme based on the error correcting Hamming codes, The \(S\)-digraph optimization problem and the greedy algorithm, Lossless image compression based on multiple-tables arithmetic coding, Minimax trees in linear time with applications, Block Huffman coding, Weighted forward looking adaptive coding, A fast algorithm for adaptive prefix coding, A fast and efficient nearly-optimal adaptive Fano coding scheme, Efficient algorithms for online decision problems, Worst-Case Optimal Adaptive Prefix Coding