English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Codes: Unequal Probabilities, Unequal Letter Cost

MPS-Authors
/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Altenkamp, D., & Mehlhorn, K. (1980). Codes: Unequal Probabilities, Unequal Letter Cost. Journal of the ACM, 27(3), 412-427. doi:10.1145/322203.322205.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AF62-2
Abstract
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.