✦ LIBER ✦

Improved computational bound for the binary erasure channel (Corresp.)

✍ Scribed by Epstein, M.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for codes in a two-access

✍ van Tilborg, H. 📂 Article 📅 1978 🏛 IEEE 🌐 English ⚖ 694 KB

Error coding bounds for the binary asymm

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

Capacity-achieving ensembles for the bin

✍ Pfister, H.D.; Sason, I.; Urbanke, R. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 763 KB

Improved error bounds for the erasure/li

✍ Barg, A. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 440 KB

An improved upper bound on the block cod

✍ McEliece, R.; Omura, J. 📂 Article 📅 1977 🏛 IEEE 🌐 English ⚖ 491 KB

An upper bound for codes for the noisy t

✍ van Tilborg, H. 📂 Article 📅 1986 🏛 IEEE 🌐 English ⚖ 677 KB