Codes: Unequal Probabilities, Unequal Letter Cost

Altenkamp, Doris; Mehlhorn, Kurt

doi:10.1145/322203.322205

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

Codes: Unequal Probabilities, Unequal Letter Cost

MPS-Authors

/persons/resource/persons45021

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

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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

引用: https://hdl.handle.net/11858/00-001M-0000-0014-AF62-2

要旨

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.