Y. Ben-haim, S. Gravier, A. Lobstein, and J. Moncel, Adaptive identification in graphs, Journal of Combinatorial Theory, Series A, vol.115, issue.7, 2007.
DOI : 10.1016/j.jcta.2007.12.009

Y. Ben-haim, S. Gravier, A. Lobstein, and J. Moncel, Adaptive identification in graphs, Journal of Combinatorial Theory, Series A, vol.115, issue.7, pp.1114-1126, 2008.
DOI : 10.1016/j.jcta.2007.12.009

Y. Ben-haim, S. Gravier, A. Lobstein, and J. Moncel, Adaptive identification in tori in the king lattice, Electron. J. Combin, vol.18, issue.13, p.116, 2011.

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

N. Bertrand, I. Charon, O. Hudry, and A. Lobstein, Identifying and locating-dominating codes on chains and cycles, European Journal of Combinatorics, vol.25, issue.7, pp.969-987, 2004.
DOI : 10.1016/j.ejc.2003.12.013

I. Charon, I. Honkala, O. Hudry, and A. Lobstein, The minimum density of an identifying code in the king lattice, Discrete Mathematics, vol.276, issue.1-3, pp.95-109, 2004.
DOI : 10.1016/S0012-365X(03)00306-6

G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering codes, 1997.

S. W. Golomb and L. R. Welch, Algebraic coding and the Lee metric, Error Correcting Codes (Proc. Sympos. Math. Res. Center, pp.175-194, 1968.

S. W. Golomb and L. R. Welch, Perfect Codes in the Lee Metric and the Packing of Polyominoes, SIAM Journal on Applied Mathematics, vol.18, issue.2, pp.302-317, 1970.
DOI : 10.1137/0118025

S. Gravier, J. Moncel, and A. Semri, Identifying codes of cycles, European Journal of Combinatorics, vol.27, issue.5, pp.767-776, 2006.
DOI : 10.1016/j.ejc.2004.09.005
URL : https://hal.archives-ouvertes.fr/hal-00360168

I. Honkala and T. Laihonen, Codes for Identification in the King Lattice, Graphs and Combinatorics, vol.19, issue.4, pp.505-516, 2003.
DOI : 10.1007/s00373-003-0531-2

I. Honkala and T. Laihonen, On the Identification of Sets of Points in the Square Lattice, Discrete and Computational Geometry, vol.29, issue.1, pp.139-152, 2003.
DOI : 10.1007/s00454-002-0730-2

I. Honkala and T. Laihonen, On Identifying Codes in the Triangular and Square Grids, SIAM Journal on Computing, vol.33, issue.2, pp.304-312, 2004.
DOI : 10.1137/S0097539703433110

I. Honkala and A. Lobstein, On the Density of Identifying Codes in the Square Lattice, Journal of Combinatorial Theory, Series B, vol.85, issue.2, pp.297-306, 2002.
DOI : 10.1006/jctb.2001.2106

M. G. 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

A. Lobstein, Watching systems, identifying, locating-dominating and discrminating codes in graphs, a bibliography

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

D. L. Roberts and F. S. Roberts, Locating sensors in paths and cycles: The case of 2-identifying codes, European Journal of Combinatorics, vol.29, issue.1, pp.72-82, 2008.
DOI : 10.1016/j.ejc.2006.12.006