✦ LIBER ✦

The random coding bound is tight for the average code (Corresp.)

✍ Scribed by Gallager, R.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight lower bounds for optimum code leng

✍ Rissanen, J. 📂 Article 📅 1982 🏛 IEEE 🌐 English ⚖ 320 KB

Error coding bounds for the binary asymm

✍ Gordon, T. 📂 Article 📅 1963 🏛 IEEE 🌐 English ⚖ 419 KB

An achievable bound for optimal noiseles

✍ Verriest, E. 📂 Article 📅 1986 🏛 IEEE 🌐 English ⚖ 362 KB

Bounds on the redundancy of Huffman code

✍ Capocelli, R.; Giancarlo, R.; Taneja, I. 📂 Article 📅 1986 🏛 IEEE 🌐 English ⚖ 547 KB

Bounds on the probability of error for c

✍ Chin-Long Chen; Rutledge, R. 📂 Article 📅 1976 🏛 IEEE 🌐 English ⚖ 402 KB

The extended Nadler code is unique (Corr

✍ Goethals, J.-M. 📂 Article 📅 1977 🏛 IEEE 🌐 English ⚖ 768 KB