Comments on "New Bounds for Codes Identifying Vertices in Graphs", by Gérard Cohen, Iiro Honkala, Antoine Lobstein and Gilles Zémor
Comment by Gérard Cohen, Sylvain Gravier, Iiro Honkala, Antoine
Lobstein, Michel Mollard, Charles Payan and Gilles Zémor, June 10, 1999:
These comments give constructions reducing the gap between upper and
lower bounds on the smallest density of an identifying code on the
infinite rectangular grid to less than 0.002: as a PostScript file.