Optimal codes for strong identification

European Journal of Combinatorics

Volumn 23, Issue 3, 2002, Pages 307-313

  Laihonen, Tero ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036081158     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.2002.0571     Document Type: Article

References (14)

1. U. Blass, I. Honkala and S. Litsyn, Bounds on identifying codes, Discrete Math., 241 (2001), 119-128.
2. U. Blass, I. Honkala and S. Litsyn, On binary codes for identification, J. Comb. Des., 8 (2000), 151-156.
3. I. Charon, I. Honkala, O. Hudry and A. Lobstein, General bounds for identifying codes in some infinite regular graphs, Electron. J. Comb., 8 (2001), R39.
4. G. Cohen, I. Honkala, S. Litsyn and A. Lobstein, Covering Codes, Elsevier, Amsterdam, The Netherlands, 1997.
5. G. Cohen, I. Honkala, A. Lobstein and G. Zémor, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Proceedings of the DIMACS Workshop on Codes and Association Schemes November 9-12, 1999, 2001, pp. 97-109.
6. G. Exoo, Computational results on identifying t-codes, preprint.
7. I. Honkala, On the identifying radius of codes, in: Proceedings of the Seventh Nordic Combinatorial Conference, Turku, 1999, pp. 39-43.
8. I. Honkala, T. Laihonen and S. Ranto, On codes identifying sets of vertices in Hamming spaces, Des. Codes Cryptogr., 24 (2001), 193-204.
9. I. Honkala, T. Laihonen and S. Ranto, On strongly identifying codes, Discrete Math., to appear.
10. I. Honkala, T. Laihonen and S. Ranto, Codes for strong identification, Electronic Notes in Discrete Mathematics, 6 (2001).
11. M. G. Karpovsky, K. Chakrabarty and B. L. Levitin, On a new class of codes for identifying vertices in graphs, IEEE Trans. Inform. Theory, 44 (1998), 599-611.
12. T. Laihonen, Sequences of Optimal Identifying Codes, IEEE Trans. Inform. Theory, to appear.
13. T. Laihonen and S. Ranto, Families of optimal codes for strong identification, Discrete Appl. Math., to appear.
14. S. Ranto, I. Honkala and T. Laihonen, Two families of optimal identifying codes in binary Hamming spaces, IEEE Trans. Inform. Theory, to appear.