✦ LIBER ✦

On the optimality of a simple prefix code

✍ Scribed by Zs. Baranyai

Publisher: Akadmiai Kiad
Year: 1974
Tongue: English
Weight: 288 KB
Volume: 25
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01886104

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the optimality of the genetic code

✍ P. B. Milanov; P. S. Kenderov; O. Ch. Ivanov 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 125 KB

Approximate prefix coding for system-on-

Approximate prefix coding for system-on-a-chip programs

✍ Shlomo Weiss; Roman Tsikel 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 147 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

A unimodality property of optimal exhaus

A unimodality property of optimal exhaustive prefix codes and retrieval trees over alphabets of varying size

✍ L.E. Stanfel 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 595 KB

Optimal computation of prefix sums on a

Optimal computation of prefix sums on a binary tree of processors

✍ Henk Meijer; Selim G. Akl 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 406 KB

On the optimality of a simple strategy f

On the optimality of a simple strategy for searching graphs

✍ Shmuel Gal 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 105 KB