Mehlhorn, Kurt An efficient algorithm for constructing nearly optimal prefix codes. (English) Zbl 0439.94017 IEEE Trans. Inf. Theory 26, 513-517 (1980). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 Document MSC: 94A45 Prefix, length-variable, comma-free codes 94A24 Coding theorems (Shannon theory) 68Q25 Analysis of algorithms and problem complexity 68T99 Artificial intelligence Keywords:nearly optimal prefix codes; unequal letter costs; unequal probabilities; average cost PDFBibTeX XMLCite \textit{K. Mehlhorn}, IEEE Trans. Inf. Theory 26, 513--517 (1980; Zbl 0439.94017) Full Text: DOI