๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs

โœ Scribed by Baer, M.B.

Book ID
114641051
Publisher
IEEE
Year
2008
Tongue
English
Weight
424 KB
Volume
54
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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