Identifying codes with small radius in some infinite regular graphs

Electronic Journal of Combinatorics

Volumn 9, Issue 1 R, 2002, Pages 1-25

  Charon, Irène ^a   Hudry, Olivier ^a   Lobstein, Antoine ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4043097503     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1628     Document Type: Article

References (15)

1. U. Blass, I. Honkala, S. Litsyn: On binary codes for identification, Journal of Combinatorial Designs, vol. 8, pp. 151-156, 2000.
2. U. Blass, I. Honkala, S. Litsyn: Bounds on identifying codes, Discrete Mathematics, vol. 241, pp. 119-128, 2001.
3. I. Charon, I. Honkala, O. Hudry, A. Lobstein: General bounds for identifying codes in some infinite regular graphs, Electronic Journal of Combinatorics, vol. 8(1), R39, 2001.
4. I. Charon, I. Honkala, O. Hudry, A. Lobstein: The minimum density of an identifying code in the king lattice, Discrete Mathematics, submitted.
5. I. Charon, O. Hudry: The noising methods: A generalization of some metaheuristics, European Journal of Operational Research, vol. 135, pp. 86-101, 2001.
6. 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.
7. 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.
8. 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(4), pp. 492-504, 2000.
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, pp. 97-109, 2001.
10. G. Cohen, I. Honkala, A. Lobstein, G. Zemor: On codes identifying vertices in the two-dimensional square lattice with diagonals, IEEE Transactions on Computers, vol. 50, pp. 174-176, 2001.
11. 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 (Algo-Tel '99), Actes, pp. 19-22, 1999.
12. G. Exoo: Computational results on identifying t-codes, Preprint, 1999.
13. I. Honkala: On the identifying radius of codes. In: Proceedings of the 7th Nordic Combinatorial Conference (eds. T. Harju and I. Honkala), Turku, 1999.
14. I. Honkala, A. Lobstein: On the density of identifying codes in the square lattice, Journal of Combinatorial Theory, Ser. B, to appear.
15. 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.