Y. Ben-haim and S. Litsyn, Exact Minimum Density of Codes Identifying Vertices in the Square Grid, SIAM Journal on Discrete Mathematics, vol.19, issue.1, pp.69-82, 2005.
DOI : 10.1137/S0895480104444089

M. Bouznif, F. Havet, and M. Preissman, Minimum-Density Identifying Codes in Square Grids, Lect. Notes Computer Science, vol.249, issue.1???3, pp.77-88, 2016.
DOI : 10.1016/S0012-365X(01)00244-8
URL : https://hal.archives-ouvertes.fr/hal-01346750

I. Charon, O. Hudry, and A. Lobstein, Identifying Codes with Small Radius in Some Infinite Regular Graphs, Elec. J. Combinatorics, vol.9, p.11, 2002.

G. Cohen, S. Gravier, I. Honkala, A. Lobstein, M. Mollard et al., Improved identifying codes for the grid

G. Cohen, I. Honkala, A. Lobstein, and G. Zemor, Bounds for Codes Identifying Vertices in the Hexagonal Grid, SIAM Journal on Discrete Mathematics, vol.13, issue.4, pp.492-504, 2000.
DOI : 10.1137/S0895480199360990

G. Cohen, I. Honkala, A. Lobstein, and G. Zémor, New bounds for codes identifying vertices in graphs, Elec. J. Combinatorics, vol.6, issue.1, p.19, 1999.

D. Cranston and G. Yu, A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid, Elec. J. Combinatorics, vol.16, p.113, 2009.

A. Cukierman and G. Yu, New bounds on the minimum density of an identifying code for the infinite hexagonal grid, Discrete Applied Mathematics, vol.161, issue.18, pp.2910-2924, 2013.
DOI : 10.1016/j.dam.2013.06.002

M. Daniel, S. Gravier, and J. Moncel, Identifying codes in some subgraphs of the square lattice, Theoretical Computer Science, vol.319, issue.1-3, pp.411-421, 2004.
DOI : 10.1016/j.tcs.2004.02.007

R. Dantas, F. Havet, and R. Sampaio, Identifying codes for infinite triangular grids with a finite number of rows, Discrete Mathematics, vol.340, issue.7
DOI : 10.1016/j.disc.2017.02.015
URL : https://hal.archives-ouvertes.fr/hal-01411109

M. Jiang, Periodicity of identifying codes in strips

M. Karpovsky, K. Chakrabarty, and L. B. Levitin, On a new class of codes for identifying vertices in graphs, IEEE Transactions on Information Theory, vol.44, issue.2, pp.599-611, 1998.
DOI : 10.1109/18.661507