Fast Construction of Nearly-Optimal Prefix Codes without Probability Sorting

摘要

In this abstract, an algorithm is proposed that achieves nearly-optimal coding without sorting the probabilities or building a tree of codes. The complexity is proportional to the maximum code length, making it especially attractive for large alphabets.