On binary codes for identification

Journal of Combinatorial Designs

Volumn 8, Issue 2, 2000, Pages 151-156

  Blass, Uri ^a   Honkala, Iiro ^b   Litsyn, Simon ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000369633     PISSN: 10638539     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-S     Document Type: Article

References (7)

1. U. Blass, I. Honkala, and S. Litsyn, Bounds on identifying codes, Discrete Math., (to appear).
2. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering codes. Elsevier, Amsterdam, 1997.
3. G. Cohen, I. Honkala, A. Lobstein, and G. Zémor, New bounds for codes identifying vertices in graphs, Electronic J. Combinatorics, 6(1) (1999), R19.
4. G. Exoo, Computational results on identifying t-codes, in preparation.
5. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Domination in graphs. Marcel Dekker, 1998.
6. M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, On a new class of codes for identifying vertices in graphs, IEEE Trans. Inform. Theory, 44 (1998), 599-611.
7. M. G. Karpovsky, K. Chakrabarty, L. B. Levitin, and D. R. Avresky, On the covering of vertices for fault diagnosis in hypercubes. Inform. Processing Lett., 69 (1999), 99-103.