𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comments on “Optimal Binary Communications With Nonequal Probabilities”

✍ Scribed by Ipatov, V. P.


Book ID
114610018
Publisher
IEEE
Year
2007
Tongue
English
Weight
57 KB
Volume
55
Category
Article
ISSN
0090-6778

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Optimal binary prefix-condition codes wi
✍ Greenberg, Irwin 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 432 KB

Probability estimates for letters in a finite alphabet are derived in order to apply the Huffman algorithm to determine an optimal binary prefix-condition code. The estimates maximize the entropy subject to constraints specifying second-level orderings of the letters' iikeiihoods. These are compared