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

I. Charon, I. Honkala, O. Hudry, and A. Lobstein, General bounds for identifying codes in some infinite regular graphs, Electron. J. Combin, vol.8, issue.1, 2001.

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.

A. Cukierman and G. Yu, New bounds on the minimum density of an identifying code for the infinite hexagonal grid Discrete Applied Math, pp.2910-2924, 2013.

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

I. Honkala, A family of optimal identifying codes in <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msup><mml:mi mathvariant="double-struck">Z</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:math>, Journal of Combinatorial Theory, Series A, vol.113, issue.8, pp.1760-1763, 2006.
DOI : 10.1016/j.jcta.2006.03.011

V. Junnila, New lower bound for 2-identifying code in the square grid, Discrete Applied Mathematics, vol.161, issue.13-14, pp.13-142042, 2013.
DOI : 10.1016/j.dam.2013.02.032

V. Junnila and T. Laihonen, Optimal lower bound for 2-identifying codes in the hexagonal grid, Paper 38, 2012.

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

P. J. Slater, Fault-tolerant locating-dominating sets, Discrete Mathematics, vol.249, issue.1-3, pp.179-189, 2002.
DOI : 10.1016/S0012-365X(01)00244-8