Adaptive identification in graphs

An adaptive version of identifying codes is introduced. These codes are motivated by various engineering applications. Bounds on adaptive identifying codes are given for regular graphs and torii in the square grid. The new codes are compared to the classical non-adaptive case.

[1]  Antoine Lobstein,et al.  Identifying Codes with Small Radius in Some Infinite Regular Graphs , 2002, Electron. J. Comb..

[2]  Iiro S. Honkala,et al.  On identification in the triangular grid , 2004, J. Comb. Theory, Ser. B.

[3]  S. Golomb,et al.  Perfect Codes in the Lee Metric and the Packing of Polyominoes , 1970 .

[4]  Sylvain Gravier,et al.  Construction of Codes Identifying Sets of Vertices , 2005, Electron. J. Comb..

[5]  Iiro S. Honkala,et al.  On Codes Identifying Sets of Vertices in Hamming Spaces , 2000, Des. Codes Cryptogr..

[6]  David Starobinski,et al.  Robust location detection with sensor networks , 2004, IEEE Journal on Selected Areas in Communications.

[7]  S. Litsyn,et al.  On binary codes for identification , 2000 .

[8]  Mark G. Karpovsky,et al.  On a New Class of Codes for Identifying Vertices in Graphs , 1998, IEEE Trans. Inf. Theory.

[9]  Tero Laihonen,et al.  Codes Identifying Sets of Vertices , 2001, AAECC.

[10]  Iiro S. Honkala,et al.  The minimum density of an identifying code in the king lattice , 2004, Discret. Math..

[11]  Simon Litsyn,et al.  Exact Minimum Density of Codes Identifying Vertices in the Square Grid , 2005, SIAM J. Discret. Math..

[12]  J. Moncel.  Codes Identifiants dans les Graphes , 2005 .

[13]  Iiro S. Honkala,et al.  On the Identification of Sets of Points in the Square Lattice , 2003, Discret. Comput. Geom..

[14]  Iiro S. Honkala,et al.  General Bounds for Identifying Codes in Some Infinite Regular Graphs , 2001, Electron. J. Comb..

[15]  M. Ruszinkó.  On a 2-dimensional search problem , 1993 .

[16]  Iiro S. Honkala,et al.  On Identifying Codes in Binary Hamming Spaces , 2002, J. Comb. Theory, Ser. A.