New bounds for codes identifying vertices in graphs

Electronic Journal of Combinatorics

Volumn 6, Issue 1, 1999, Pages

  Cohen, Gérard ^a   Honkala, Iiro ^b   Lobstein, Antoine ^a   Zémor, Gilles ^a  

^a TELECOM PARISTECH   (France)

^b Universität Turku   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001803372     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1451     Document Type: Article

References (4)

1. U. Blass, I. Honkala and S. Litsyn: Bounds on identifying codes, Discrete Math., to appear.
2. G. D. Cohen, I. Honkala, S. Litsyn and A. Lobstein: Covering Codes, Elsevier, 1997.
3. M. G. Karpovsky, K. Chakrabarty and L. B. Levitin: On a new class of codes for identifying vertices in graphs, IEEE Trans. Inform. Th., vol. 44, pp. 599-611, 1998.
4. http://www.infres.enst.fr/~lobstein/unpublished.html