Codes identifying sets of vertices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2227, Issue , 2001, Pages 82-91

  Laihonen, Tero ^a   Ranto, Sanna ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

FAULTY PROCESSORS; GENERAL GRAPH; HYPERCUBE; IDENTIFYING CODE; LOWER BOUNDS; MULTI PROCESSOR SYSTEMS; OPTIMAL CODES;

CODES (SYMBOLS);

EID: 84974679383     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45624-4_9     Document Type: Conference Paper

References (16)

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. Des., 8 (2000) 151-156
3. I. Charon, I. Honkala, O. Hudry, A. Lobstein: General bounds for identifying codes in some infinite regular graphs. Electronic Journal of Combinatorics, submitted
4. G. Cohen, I. Honkala, S. Litsyn, A. Lobstein: Covering Codes. Elsevier, Amsterdam, the Netherlands (1997)
5. G. Cohen, I. Honkala, A. Lobstein, G. Zémor: On identifying codes. In: Barg, A., Litsyn, S. (eds.): Codes and Association Schemes. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 56 (2001) 97–109
6. G. Exoo: Computational results on identifying t-codes. Preprint
7. I. Honkala: On the identifying radius of codes. Proceedings of the Seventh Nordic Combinatorial Conference, Turku, (1999) 39–43
8. I. Honkala: Triple systems for identifying quadruples. Australasian J. Combinatorics, to appear
9. I. Honkala, T. Laihonen, S. Ranto: On codes identifying sets of vertices in Hamming spaces. Des. Codes Cryptogr., to appear
10. I. Honkala, T. Laihonen, S. Ranto: On strongly identifying codes. Discrete Math., to appear
11. I. Honkala, T. Laihonen, S. Ranto: Codes for strong identification. Electronic Notes in Discrete Mathematics, to appear
12. 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
13. T. Laihonen: Sequences of optimal identifying codes. IEEE Trans. Inform. Theory, submitted
14. T. Laihonen: Optimal codes for strong identification, European J. Combinatorics, Submitted
15. T. Laihonen, S. Ranto: Families of optimal codes for strong identification. Discrete Appl. Math., to appear
16. S. Ranto, I. Honkala, T. Laihonen: Two families of optimal identifying codes in binary Hamming spaces. IEEE Trans. Inform. Theory, submitted