An efficient algorithm for constructing nearly optimal prefix codes

Abstract

A new algorithm for constructing nearly optimal prefix codes in the case of unequal letter costs and unequal probabilities is presented. A bound on the maximal deviation from the optimum is derived and numerical examples are given. The algorithm has running time O(t·n) where t is the number of letters and n is the number of probabilities