A two-page complement to

New Bounds for Codes Identifying Vertices in Graphs

by   G. Cohen,   I. Honkala,   A. Lobstein   and   G. Zémor,

published in   Electronic Journal of Combinatorics 6(1), 1999.

|| file.pdf ||     || file.ps ||     || file.dvi ||     || back to EJC ||

Last modified: Mon Apr 10 16:01:06 MEST 2006

Please note that the exact value of the smallest density of a 1-identifying code
in the infinite square grid is now known to be 0.35, see
Y. Ben-Haim and S. Litsyn,
Exact Minimum Density of Codes Identifying Vertices in the Square Grid,
SIAM Journal on Discrete Mathematics, Vol. 19, pp. 69 - 82, 2005.