S. Haim and . Litsyn, Exact minimum density of codes identifying vertices in the square grid, SIAM J. Discrete Math, pp.69-82, 2005.

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. Zémor, New bounds for codes identifying vertices in graphs, Electronic Journal of Combinatorics, vol.6, issue.1, p.19, 1999.

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

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

S. Ray, D. Starobinski, A. Trachtenberg, and R. Ungrangsi, Robust Location Detection With Sensor Networks, IEEE Journal on Selected Areas in Communications, vol.22, issue.6, pp.1016-1025, 2004.
DOI : 10.1109/JSAC.2004.830895
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.6722