A fast algorithm for adaptive prefix coding
DOI10.1007/S00453-007-9140-4zbMATH Open1172.94005OpenAlexW2022196704MaRDI QIDQ2391182FDOQ2391182
Authors: Marek Karpinski, Yakov Nekrich 
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
Recommendations
- Fast adaptive coding algorithm
- Fast and Compact Prefix Codes
- Worst-Case Optimal Adaptive Prefix Coding
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- Publication:4945375
- Efficient and Compact Representations of Prefix Codes
- scientific article; zbMATH DE number 3930882
- Efficient method of adaptive arithmetic coding for sources with large alphabets
- Faster algorithm for designing optimal prefix-free codes with unequal letter costs
- A fast and space-economical algorithm for length-limited coding
Prefix, length-variable, comma-free codes (94A45) Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- A Mathematical Theory of Communication
- A Method for the Construction of Minimum-Redundancy Codes
- Surpassing the information theoretic bound with fusion trees
- Generating a canonical prefix encoding
- Fusion trees can be implemented with \(AC^0\) instructions only
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- Dynamic huffman coding
- Design and analysis of dynamic Huffman codes
- Variations on a theme by Huffman
- Bounding the Compression Loss of the FGK Algorithm
- Data compression
- New bounds on the redundancy of Huffman codes
- Algorithms – ESA 2004
- Combinatorial Merging
- On-line adaptive canonical prefix coding with bounded compression loss
Cited In (6)
This page was built for publication: A fast algorithm for adaptive prefix coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391182)
