More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding

Abstract

There is a large literature devoted to the problem of finding an optimal (min-cost) prefix-free code with an unequal letter-cost encoding alphabet of size. While there is no known polynomial time algorithm for solving it optimally, there are many good heuristics that all provide additive errors to optimal. The additive error in these algorithms usually depends linearly upon the largest encoding letter size. This paper was motivated by the problem of finding optimal codes when the encoding alphabet is infinite. Because the largest letter cost is infinite, the previous analyses could give infinite error bounds. We provide a new algorithm that works with infinite encoding alphabets. When restricted to the finite alphabet case, our algorithm often provides better error bounds than the best previous ones known.

DOI: 10.1109/TIT.2008.926326

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@article{Golin2007MoreEA, title={More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding}, author={Mordecai J. Golin and Jian Li}, journal={IEEE Transactions on Information Theory}, year={2007}, volume={54}, pages={3412-3424} }