On strongly identifying codes

Discrete Mathematics

Volumn 254, Issue 1-3, 2002, Pages 191-205

  Honkala, Iiro ^a   Laihonen, Tero ^a   Ranto, Sanna ^b  

^a UNIVERSITY OF TURKU   (Finland)

^b TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 31244437345     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00357-0     Document Type: Article

References (20)

1. U. Blass, I. Honkala, S. Litsyn, Bounds on identifying codes, Discrete Math., to appear.
2. U. Blass, I. Honkala, S. Litsyn, On binary codes for identification, J. Combin. Designs 8 (2000) 151-156.
3. G. Cohen, P. Frankl, On tilings of the binary vector space, Discrete Math. 31 (1980) 271-277.
4. G. Cohen, S. Gravier, I. Honkala, A. Lobstein, M. Mollard, C. Payan, G. Zémor, Improved identifying codes for the grid, Electron. J. Combin. Comments to 6 (1) (1999) R19.
5. G. Cohen, I. Honkala, S. Litsyn, A. Lobstein, Covering Codes, Elsevier, Amsterdam, 1997.
6. G. Cohen, I. Honkala, A. Lobstein, G. Zémor, New bounds for codes identifying vertices in graphs, Electron. J. Combin. 6 (1) (1999) R19.
7. G. Cohen, I. Honkala, A. Lobstein, G. Zémor, On codes identifying vertices in the two-dimensional square lattice with diagonals, IEEE Trans. Comput. 50 (2001) 174-176.
8. G. Cohen, I. Honkala, A. Lobstein, G. Zémor, Bounds for codes identifying vertices in the hexagonal grid, SIAM J. Discrete Math. 13 (2000) 492-504.
9. G. Cohen, I. Honkala, A. Lobstein, G. Zémor, On identifying codes, DIMACS Series, in: A. Barg, S. Litsyn (Eds.), Discrete Mathematics and Theoretical Computer Science, Proceedings of the DIMACS Workshop on Codes and Association Schemes, November 9-12, 1999, pp. 97-109.
10. G. Exoo, Computational results on identifying t-codes, preprint.
11. D.K. Garnick, Y.H.H. Kwong, F. Lazebnik, Extremal graphs without three-cycles or four-cycles, J. Graph Theory 17 (1993) 633-645.
12. D. Garnick, N.A. Nieuwejaar, Nonisomorphic extremal graphs without three-cycles or four-cycles, J. Combin. Math. Combin. Comput. 12 (1992) 33-56.
13. I. Honkala, On the identifying radius of codes, Proceedings of the Seventh Nordic Combinatorial Conference, Turku, 1999, pp. 39-43.
14. I. Honkala, T. Laihonen, S. Ranto, On codes identifying sets of vertices in Hamming spaces, Designs, Codes and Cryptography 24 (2001) 193-204.
15. M.G. Karpovsky, K. Chakrabarty, L.B. Levitin, On a new class of codes for identifying vertices in graphs, IEEE Trans. Inform. Theory 44 (1998) 599-611.
16. T. Laihonen, S. Ranto, Codes identifying sets of vertices, Lecture Notes in Computer Science, Proceedings of AAECC-14, to appear.
17. P.R.J. Östergård, New multiple covering codes by tabu search, Australasian J. Combin. 12 (1995) 145-155.
18. S. Ranto, I. Honkala, T. Laihonen, Two families of optimal identifying codes in binary Hamming spaces, IEEE Trans. Inform. Theory, submitted for publication.
19. N.J.A. Sloane, The On-Line Encyclopedia of Integer Sequences, Published electronically at http://www.research.att.com/njas/sequences.
20. R. Struik, Covering Codes, Ph. D. thesis, Eindhoven University of Technology, the Netherlands, 1994, 106pp.