✦ LIBER ✦

Bounds for Codes Identifying Vertices in the Hexagonal Grid

✍ Scribed by Cohen, Gérard D.; Honkala, Iiro; Lobstein, Antoine; Zémor, Gilles

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exact Minimum Density of Codes Identifyi

✍ Ben-Haim, Yael; Litsyn, Simon 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 190 KB

Improved Bounds for r -Identifying Codes

✍ Stanton, Brendon 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 239 KB

New bounds for (r, ≤ 2)-identifying code

✍ Mikko Pelto 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 450 KB

On a new class of codes for identifying

✍ Karpovsky, M.G.; Chakrabarty, K.; Levitin, L.B. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 629 KB

On Identifying Codes in the Triangular a

✍ Honkala, Iiro; Laihonen, Tero 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 150 KB

Exponential error bounds for random code

✍ Ericson, T. 📂 Article 📅 1985 🏛 IEEE 🌐 English ⚖ 968 KB