Journal of Algorithms
Design and analysis of dynamic Huffman codes
Journal of the ACM (JACM)
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Fusion trees can be implemented with AC0 instructions only
Theoretical Computer Science
Bounding the compression loss of the FGK algorithm
Journal of Algorithms
Generating a canonical prefix encoding
Communications of the ACM
Information Processing Letters
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
An Efficient Implementation of Adaptive Prefix Coding
DCC '07 Proceedings of the 2007 Data Compression Conference
Low-Memory Adaptive Prefix Coding
DCC '09 Proceedings of the 2009 Data Compression Conference
A Fast Algorithm for Adaptive Prefix Coding
Algorithmica
On-line adaptive canonical prefix coding with bounded compression loss
IEEE Transactions on Information Theory
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Tight bounds for online stable sorting
Journal of Discrete Algorithms
Minimax trees in linear time with applications
European Journal of Combinatorics
Hi-index | 0.00 |
A common complaint about adaptive prefix coding is that it is much slower than static prefix coding. Karpinski and Nekrich recently took an important step towards resolving this: they gave an adaptive Shannon coding algorithm that encodes each character in O (1) amortized time and decodes it in O (logH + 1) amortized time, where H is the empirical entropy of the input string s . For comparison, Gagie's adaptive Shannon coder and both Knuth's and Vitter's adaptive Huffman coders all use ***(H + 1) amortized time for each character. In this paper we give an adaptive Shannon coder that both encodes and decodes each character in O (1) worst-case time. As with both previous adaptive Shannon coders, we store s in at most (H + 1) |s | + o (|s |) bits. We also show that this encoding length is worst-case optimal up to the lower order term. In short, we present the first algorithm for adaptive prefix coding that encodes and decodes each character in optimal worst-case time while producing an encoding whose length is also worst-case optimal.