More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
Mordecai J. Golin, Jian Li · IEEE Transactions on Information Theory · 2008
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.