TY  - RPRT
T1  - Codes : unequal probabilities, unequal letter costs
T3  - Saarbrücken, 1978
A1  - Altenkamp,Doris
A1  - Mehlhorn,Kurt
Y1  - 2011/09/02
N2  - The construction of alphabetic prefix codes with unequal letter costs and unequal probabilities is considered. A variant of the noiseless coding theorem is proved giving closely matching lower and upper bounds for the cost of the optimal code. Furthermore, an algorithm is described which constructs a nearly optimal code in linear time.
CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/4151
ER  -