✦ LIBER ✦

Improved Upper Bounds on Binary Identifying Codes

✍ Scribed by Exoo, G.; Laihonen, T.; Ranto, S.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved upper bounds on sizes of codes

✍ Mounits, B.; Etzion, T.; Litsyn, S. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 341 KB

New upper bounds for binary covering cod

✍ Patric R.J. Östergård; Markku K. Kaikkonen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 755 KB

A table of upper bounds for binary codes

✍ Agrell, E.; Vardy, A.; Zeger, K. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 249 KB

Improved Performance Upper Bounds for Te

✍ Hichan Moon; Cox, D.C. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 127 KB

Upper bounds on separating codes

✍ Cohen, G.D.; Schaathun, H.G. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 212 KB

Improving the Upper Bounds on the Coveri

✍ Carlet, C.; Mesnager, S. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 389 KB