Bounds for codes identifying vertices in the hexagonal grid

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 4, 2000, Pages 492-504

  Cohen, Gérard D ^a   Honkala, Iiro ^b   Lobstein, Antoine ^a   Zémor, Gilles ^a  

^a CNRS   (France)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

Code; Density; Graph; Hexagonal grid; Identifying code

Indexed keywords

EID: 0000460898     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480199360990     Document Type: Article

References (9)

1. U. BLASS, I. HONKALA, AND S. LITSYN, Bounds on identifying codes, Discrete Math., to appear.
2. U. BLASS, I. HONKALA, AND S. LITSYN, On binary codes for identification, J. Combin. Des., 8 (2000), pp. 151-156.
3. G. COHEN, S. GRAVIER, I. HONKALA, A. LOBSTEIN, M MOLLARD, C. PAYAN, AND G. ZÉMOR, Improved identifying codes for the grid, Electron. J. Combin., Comments to 6 (1999), R19, http://www.combinatorics.org/Volume_6/Html/v6i1r19.html.
4. G. COHEN, I. HONKALA, A. LOBSTEIN, AND G. ZÉMOR, New bounds for codes identifying vertices in graphs, Electron. J. Combin., 6 (1999), R19, http://www. combinatorics.org/Volume_6/PDF/v6i1r19.pdf.
5. G. COHEN, I. HONKALA, A. LOBSTEIN, AND G. ZÉMOR, On codes identifying vertices in the two-dimensional square lattice with diagonals, IEEE Trans. Comput., to appear.
6. G. COHEN, I. HONKALA, A LOBSTEIN, AND G. ZÉMOR, On identifying codes, submitted to the Proceedings of the DIMACS Workshop on Codes and Association Schemes, Rutgers University, Piscataway, NJ, 1999.
7. T. W. HAYNES, S. T HEDETNIEMI, AND P. J. SLATER, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
8. M. G. KARPOVSKY, K. CHAKRABARTY, AND L. B. LEVITIN, On a new class of codes for identifying vertices in graphs, IEEE Trans. Inform. Theory, 44 (1998), pp. 599-611.
9. M. G. KARPOVSKY, K. CHAKRABARTY, L. B. LEVITIN, AND D. R. AVRESKY, On the covering of vertices for fault diagnosis in hypercubes, Inform. Process. Lett., 69 (1999), pp. 99-103.