General bounds for identifying codes in some infinite regular graphs

Electronic Journal of Combinatorics

Volumn 8, Issue 1 R, 2001, Pages 1-21

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

^a TELECOM PARISTECH   (France)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2342569397     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1583     Document Type: Article

References (14)

1. U. Blass, I. Honkala, S. Litsyn: On binary codes for identification, Journal of Com-binatorial Designs, vol. 8, pp. 151-156, 2000.
2. U. Blass, I. Honkala, S. Litsyn: Bounds on identifying codes, Discrete Mathematics, to appear.
3. I. Charon, I. Honkala, O. Hudry, A. Lobstein: The minimum density of an identifying code in the king lattice, Discrete Mathematics, submitted.
4. I. Charon, O. Hudry, A. Lobstein: Identifying codes with small radius in some infinite regular graphs, submitted.
5. G. Cohen, S. Gravier, I. Honkala, A. Lobstein, M. Mollard, C. Payan, G. Zémor: Improved identifying codes for the grid, Electronic Journal of Combinatorics, Comments to 6(1), R19, 1999.
6. G. Cohen, I. Honkala, A. Lobstein, G. Zémor: New bounds for codes identifying vertices in graphs, Electronic Journal of Combinatorics, vol. 6(1), R19, 1999.
7. G. Cohen, I. Honkala, A. Lobstein, G. Zémor: Bounds for codes identifying vertices in the hexagonal grid, SIAM Journal on Discrete Mathematics, vol. 13, pp. 492-504, 2000.
8. G. Cohen, I. Honkala, A. Lobstein, G. Zémor: On codes identifying vertices in the two-dimensional square lattice with diagonals, IEEE Transactions on Computers, vol. 50, pp. 174-176, 2001.
9. G. Cohen, I. Honkala, A. Lobstein, G. Zémor: On identifying codes. In: Proceedings of the DIMACS Workshop on Codes and Association Schemes, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 56, AMS, Providence, pp. 97-109, 2001.
10. G. Cohen, A. Lobstein, G. Zémor: Identification d'une station defaillante dans un contexte radio-mobile. In: Aspects Algorithmiques des Telecommunications (AlgoTel '99), Actes, pp. 19-22, 1999.
11. G. Exoo: Computational results on identifying t-codes, Preprint, 1999.
12. I. Honkala: On the identifying radius of codes. In: Proceedings of the 7th Nordic Combinatorial Conference (eds. T. Harju and I. Honkala), Turku, 1999.
13. I. Honkala, A. Lobstein: On the density of identifying codes in the square lattice, Journal of Combinatorial Theory (B), to appear.
14. M. G. Karpovsky, K. Chakrabarty, L. B. Levitin: On a new class of codes for identifying vertices in graphs, IEEE Transactions on Information Theory, vol. 44, pp. 599-611, 1998.