𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal binary communication with nonequal probabilities

✍ Scribed by Korn, I.; Fonseka, J.P.; Shaohui Xing

Book ID
114608802
Publisher
IEEE
Year
2003
Tongue
English
Weight
378 KB
Volume
51
Category
Article
ISSN
0090-6778

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimal binary prefix-condition codes wi
Optimal binary prefix-condition codes with ordinal probabilities
✍ 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