Design and analysis of dynamic Huffman codes
From MaRDI portal
Publication:3778663
DOI10.1145/31846.42227zbMath0637.94002MaRDI QIDQ3778663
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
entropy; distributed computing; file compression; one-pass algorithm for constructing dynamic Huffman codes; online encoding/decoding in data networks
Related Items
Optimal Prefix Codes And Huffman Codes, Optimal synchronous coding, Dynamic Trees with Almost-Optimal Access Cost, Forward looking Huffman 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, Weighted forward looking adaptive coding, Optimal prefix codes with fewer distinct codeword lengths are faster to construct, A fast algorithm for adaptive prefix coding, A fast and efficient nearly-optimal adaptive Fano coding scheme, Bidirectional adaptive compression, Remark on “Algorithm 673, Worst-Case Optimal Adaptive Prefix Coding
