✦ LIBER ✦

Asymptotic Upper Bound for the Rate of (w,r) Cover-Free Codes

✍ Scribed by V. S. Lebedev

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the construction of (w, r) cover-free

✍ V. M. Sidelnikov; O. Yu. Prikhodov 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 355 KB

On the Optimality of Trivial (w,r)-Cover

✍ H. K. Kim; V. S. Lebedev 📂 Article 📅 2004 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 108 KB

Improved upper bound for the redundancy

✍ Yekhanin, S. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 158 KB

A Note on the Uniqueness of (w, r) Cover

✍ V. S. Lebedev 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 89 KB

Asymptotic bounds for the rate of colore

✍ V. S. Lebedev 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 405 KB

On the upper bound of the size of the r-

✍ Miklós Ruszinkó 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 311 KB