Worst-Case Optimal Adaptive Prefix Coding
From MaRDI portal
Publication:3183465
DOI10.1007/978-3-642-03367-4_28zbMath1253.94038arXiv0812.3306OpenAlexW1588487947MaRDI QIDQ3183465
Publication date: 20 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.3306
Analysis of algorithms and problem complexity (68Q25) Prefix, length-variable, comma-free codes (94A45) Coding theorems (Shannon theory) (94A24)
Related Items (4)
Efficient fully-compressed sequence representations ⋮ Minimax trees in linear time with applications ⋮ Tight bounds for online stable sorting ⋮ Efficient and compact representations of some non-canonical prefix-free codes
Cites Work
- A Mathematical Theory of Communication
- Tight bounds for online stable sorting
- Dynamic Shannon coding
- Fusion trees can be implemented with \(AC^0\) instructions only
- Surpassing the information theoretic bound with fusion trees
- A fast algorithm for adaptive prefix coding
- Dynamic ordered sets with exponential search trees
- Dynamic huffman coding
- Design and analysis of dynamic Huffman codes
- Variations on a theme by Huffman
- Bounding the Compression Loss of the FGK Algorithm
- On-line adaptive canonical prefix coding with bounded compression loss
- Channels which transmit letters of unequal duration
- Generating a canonical prefix encoding
- Algorithms – ESA 2004
- A Method for the Construction of Minimum-Redundancy Codes
This page was built for publication: Worst-Case Optimal Adaptive Prefix Coding
