Dynamic huffman coding

DOI10.1016/0196-6774(85)90036-7zbMath0606.94007OpenAlexW2085880494MaRDI 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 codeHuffman treefile compressionweighted path lengthOne-pass algorithms

Mathematics Subject Classification ID

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

Related Items (21)

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

This page was built for publication: Dynamic huffman coding