Codes: Unequal Probabilities, Unequal Letter Cost

DOI10.1145/322203.322205zbMath0475.94017OpenAlexW2074110129MaRDI QIDQ3931181

Doris Altenkamp, Kurt Mehlhorn

Publication date: 1980

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322203.322205

zbMATH Keywords

approximation algorithmsearch treesprefix codesnoiseless coding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Prefix, length-variable, comma-free codes (94A45) Coding theorems (Shannon theory) (94A24)

Related Items (6)

More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding ⋮ Operations research applications of dichotomous search ⋮ Trees with exponentially growing costs ⋮ Prefix codes: Equiprobable words, unequal letter costs ⋮ A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs ⋮ On the construction of prefix-free and fix-free codes with specified codeword compositions

This page was built for publication: Codes: Unequal Probabilities, Unequal Letter Cost