A Fast Algorithm for Adaptive Prefix Coding

Authors:
Marek Karpinski;Yakov Nekrich
Affiliations:
University of Bonn, Dept. of Computer Science, Bonn, Germany;University of Bonn, Dept. of Computer Science, Bonn, Germany
Venue:
Algorithmica
Year:
2009

Citing 0
Cited 3

Worst-Case Optimal Adaptive Prefix Coding

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Fast and Compact Prefix Codes

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Minimax trees in linear time with applications

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new algorithm for adaptive prefix coding. Our algorithm encodes a text S of m symbols in O(m) time, i.e., in O(1) amortized time per symbol. The length of the encoded string is bounded above by (H+1)m+O(nlog 2 m) bits where n is the alphabet size and H is the entropy. This is the first algorithm that adaptively encodes a text in O(m) time and achieves an almost optimal bound on the encoding length in the worst case. Besides that, our algorithm does not depend on an explicit code tree traversal.