Dynamic huffman coding
From MaRDI portal
Publication:3745760
DOI10.1016/0196-6774(85)90036-7zbMath0606.94007MaRDI QIDQ3745760
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
68R10: Graph theory (including graph drawing) in computer science
68P05: Data structures
94A45: Prefix, length-variable, comma-free codes
Related Items
Parity codes, Optimal binary search trees, 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, 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