A fast algorithm for adaptive prefix coding
From MaRDI portal
Publication:2391182
DOI10.1007/s00453-007-9140-4zbMath1172.94005OpenAlexW2022196704MaRDI QIDQ2391182
Yakov Nekrich, Marek Karpinski
Publication date: 24 July 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9140-4
Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Prefix, length-variable, comma-free codes (94A45)
Related Items (3)
Worst-Case Optimal Adaptive Prefix Coding ⋮ Minimax trees in linear time with applications ⋮ Space-efficient Huffman codes revisited
Cites Work
- A Mathematical Theory of Communication
- Fusion trees can be implemented with \(AC^0\) instructions only
- Surpassing the information theoretic bound with fusion trees
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- New bounds on the redundancy of Huffman codes
- Dynamic huffman coding
- Design and analysis of dynamic Huffman codes
- Data compression
- Combinatorial Merging
- Variations on a theme by Huffman
- Bounding the Compression Loss of the FGK Algorithm
- On-line adaptive canonical prefix coding with bounded compression loss
- Generating a canonical prefix encoding
- Algorithms – ESA 2004
- A Method for the Construction of Minimum-Redundancy Codes
This page was built for publication: A fast algorithm for adaptive prefix coding
