✦ LIBER ✦

Improved Bounds for r -Identifying Codes of the Hex Grid

✍ Scribed by Stanton, Brendon

Book ID: 118197130
Publisher: Society for Industrial and Applied Mathematics
Year: 2011
Tongue: English
Weight: 239 KB
Volume: 25
Category: Article
ISSN: 0895-4801
DOI: 10.1137/100791610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

New bounds for (r, ≤ 2)-identifying codes in the infinite king grid

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

Bounds for Codes Identifying Vertices in

Bounds for Codes Identifying Vertices in the Hexagonal Grid

✍ Cohen, Gérard D.; Honkala, Iiro; Lobstein, Antoine; Zémor, Gilles 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 186 KB

Exact Minimum Density of Codes Identifyi

Exact Minimum Density of Codes Identifying Vertices in the Square Grid

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

Improved lower bounds on the sizes of er

Improved lower bounds on the sizes of error-correcting codes for list decoding

✍ Wei, V.K.; Feng, G.L. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 578 KB

An improved sphere covering bound for th

An improved sphere covering bound for the codes with n=3 R+2

✍ Hou, X.-D. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 244 KB

Improved upper bound for the redundancy

Improved upper bound for the redundancy of fix-free codes

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