Design and analysis of dynamic Huffman codes

DOI10.1145/31846.42227zbMath0637.94002MaRDI 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

entropy; distributed computing; file compression; one-pass algorithm for constructing dynamic Huffman codes; online encoding/decoding in data networks

Mathematics Subject Classification ID

94A15: Information theory (general)

68N25: Theory of operating systems

68N99: Theory of software

Related Items

Optimal Prefix Codes And Huffman Codes, Optimal synchronous coding, 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, Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates, An adaptive character wordlength algorithm for data compression, Dynamic asymmetric communication, The \(S\)-digraph optimization problem and the greedy algorithm, An efficient decoding technique for Huffman codes, Minimax trees in linear time with applications, A fast algorithm for adaptive prefix coding, A fast and efficient nearly-optimal adaptive Fano coding scheme, Worst-Case Optimal Adaptive Prefix Coding