New bounds on D-ary optimal codes

Authors:
Gonzalo Navarro;Nieves Brisaboa
Affiliations:
Center for Web Research, Department of Computer Science, Univ. of Chile, Chile;Database Lab., Univ. da Coruòa, Facultade de Informática, Spain
Venue:
Information Processing Letters
Year:
2005

Citing 10
Cited 0

Text compression

Text compression
Fast and flexible word searching on compressed text

ACM Transactions on Information Systems (TOIS)
Algorithms for infinite huffman-codes

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Huffman coding with an infinite alphabet

IEEE Transactions on Information Theory
Existence of optimal prefix codes for infinite source alphabets

IEEE Transactions on Information Theory
Fixed-prefix encoding of the integers can be Huffman-optimal

IEEE Transactions on Information Theory
A note on D-ary Huffman codes

IEEE Transactions on Information Theory
Optimal source codes for geometrically distributed integer alphabets (Corresp.)

IEEE Transactions on Information Theory
Variations on a theme by Huffman

IEEE Transactions on Information Theory
Tight bounds on the redundancy of Huffman codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.90

Visualization

Abstract

We propose a simple method that, given a symbol distribution, yields upper and lower bounds on the average code length of a D-ary optimal code over that distribution. Thanks to its simplicity, the method permits deriving analytical bounds for families of parametric distributions. We demonstrate this by obtaining new bounds, much better than the existing ones, for Zipf and exponential distributions when D2.