TY  - RPRT
T1  - An efficient algorithm for constructing nearly optimal prefix codes
T3  - Saarbrücken, 1978
A1  - Mehlhorn,Kurt
Y1  - 2011/07/27
N2  - 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.

CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/4021
ER  -