✦ LIBER ✦

An upper bound for codes for the noisy two-access binary adder channel (Corresp.)

✍ Scribed by van Tilborg, H.

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

Upper bounds on for a uniquely decodable

✍ van Tilborg, H. 📂 Article 📅 1983 🏛 IEEE 🌐 English ⚖ 448 KB

Some very simple codes for the nonsynchr

✍ Deaett, M.; Wolf, J. 📂 Article 📅 1978 🏛 IEEE 🌐 English ⚖ 301 KB

Upper bound for uniquely decodable codes

✍ Bross, S.I.; Blake, I.F. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 342 KB

Error coding bounds for the binary asymm

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

A multiuser k-ary code for the noisy mul

✍ Cheng, J.; Watanabe, Y. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 190 KB