非表示:
キーワード:
-
要旨:
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. An algorithm is described which constructs a nearly optimal code
in linear time.
