Design and analysis of dynamic Huffman codes

DOI10.1145/31846.42227zbMath0637.94002OpenAlexW2138026948MaRDI QIDQ3778663

Jeffrey Scott Vitter

Publication date: 1987

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/31846.42227

zbMATH Keywords

entropydistributed computingfile compressionone-pass algorithm for constructing dynamic Huffman codesonline encoding/decoding in data networks

Mathematics Subject Classification ID

Information theory (general) (94A15) Theory of operating systems (68N25) Theory of software (68N99)

Related Items (21)

Dynamic Shannon coding ⋮ Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates ⋮ Worst-Case Optimal Adaptive Prefix Coding ⋮ A fast algorithm for adaptive prefix coding ⋮ Optimal synchronous coding ⋮ Weighted forward looking adaptive coding ⋮ A fast dynamic compression scheme for natural language texts ⋮ Bidirectional adaptive compression ⋮ Exact and approximation algorithms for error-detecting even codes ⋮ An adaptive character wordlength algorithm for data compression ⋮ Dynamic Trees with Almost-Optimal Access Cost ⋮ Is Huffmann coding dead? ⋮ Minimax trees in linear time with applications ⋮ A fast and efficient nearly-optimal adaptive Fano coding scheme ⋮ Dynamic asymmetric communication ⋮ Optimal prefix codes with fewer distinct codeword lengths are faster to construct ⋮ Forward looking Huffman coding ⋮ The \(S\)-digraph optimization problem and the greedy algorithm ⋮ Remark on “Algorithm 673 ⋮ Optimal Prefix Codes And Huffman Codes ⋮ An efficient decoding technique for Huffman codes

This page was built for publication: Design and analysis of dynamic Huffman codes