✦ LIBER ✦

A dynamic programming algorithm for constructing optimal “1”-ended binary prefix-free codes

✍ Scribed by Sze-Lok Chan; Golin, M.J.

Book ID: 114541646
Publisher: IEEE
Year: 2000
Tongue: English
Weight: 300 KB
Volume: 46
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.850708

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dynamic programming algorithm for cons

A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs

✍ Golin, M.J.; Rote, G. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 514 KB

Optimal Prefix-Free Codes for Unequal Le

Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property

✍ Phil Bradford; Mordecai J. Golin; Lawrence L. Larmore; Wojciech Rytter 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 293 KB

In this paper we discuss the problem of finding optimal prefix-free codes for unequal letter costs, a variation of the classical Huffman coding problem. Our problem consists of finding a minimal cost prefix-free code in which the encoding alphabet consists of unequal cost (length) letters, with leng