The minimum density of an identifying code in the king lattice

Discrete Mathematics

Volumn 276, Issue 1-3, 2004, Pages 95-109

  Charon, Irène ^a   Honkala, Iiro ^b   Hudry, Olivier ^a   Lobstein, Antoine ^a  

^a CNRS   (France)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

Graph theory; Identifying codes

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL GEOMETRY; MATHEMATICAL OPERATORS; SET THEORY;

IDENTIFYING CODES; KING LATTICES; VERTEX METHOD;

GRAPH THEORY;

EID: 0346154875     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00306-6     Document Type: Conference Paper

References (14)

1. Blass U., Honkala I., Litsyn S. On binary codes for identification. J. Combin. Des. 8:2000;151-156.
2. Blass U., Honkala I., Litsyn S. Bounds on identifying codes. Discrete Math. 241:2001;119-128.
3. Charon I., Honkala I., Hudry O., Lobstein A. General bounds for identifying codes in some infinite regular graphs. Electron. J. Combin. 8(1):2001;R39.
4. Charon I., Hudry O., Lobstein A. Identifying codes with small radius in some infinite regular graphs. Electron. J. Combin. 9(1):2002;R11.
5. Cohen G., Gravier S., Honkala I., Lobstein A., Mollard M., Payan C., Zémor G. Improved identifying codes for the grid. Electron. J. Combin. 6(1):1999;R19.
6. Cohen G., Honkala I., Lobstein A., Zémor G. New bounds for codes identifying vertices in graphs. Electron. J. Combin. 6(1):1999;R19.
7. Cohen G., Honkala I., Lobstein A., Zémor G. Bounds for codes identifying vertices in the hexagonal grid. SIAM J. Discrete Math. 13(4):2000;492-504.
8. G. Cohen, I. Honkala, A. Lobstein, G. Zémor, On identifying codes, in: Proceedings of the DIMACS Workshop on Codes and Association Schemes '99, Piscataway, NJ, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 56, 2001, pp. 97-109.
9. Cohen G., Honkala I., Lobstein A., Zémor G. On codes identifying vertices in the two-dimensional square lattice with diagonals. IEEE Trans. on Comput. 50:2001;174-176.
10. G. Cohen, A. Lobstein, G. Zémor, Identification d'une station défaillante dans un contexte radio-mobile, in: Aspects Algorithmiques des Télécommunications (AlgoTel '99), Roscoff, Actes, 1999, pp. 19-22.
11. G. Exoo, Computational results on identifying t -codes, preprint, 1999.
12. I. Honkala, On the identifying radius of codes, in: T. Harju, I. Honkala (Eds.), Proceedings of the Seventh Nordic Combinatorial Conference, Turku, 1999.
13. Honkala I., Lobstein A. On the density of identifying codes in the square lattice. J. Combin. Theory Ser. B. 85:2002;297-306.
14. Karpovsky M.G., Chakrabarty K., Levitin L.B. On a new class of codes for identifying vertices in graphs. IEEE Trans. Inform. Theory. 44:1998;599-611.