Bounds on identifying codes

Discrete Mathematics

Volumn 241, Issue 1-3, 2001, Pages 119-128

  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: 0035965402     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00113-3     Document Type: Article

References (8)

1. G. Cohen, I. Honkala, S. Litsyn, A. Lobstein, Covering Codes, Elsevier, Amsterdam, 1997.
2. T. Etzion, G. Greenberg, Constructions for perfect mixed codes and other covering codes, IEEE Trans. Inform. Theory 39 (1993) 209-214.
3. H.O. Hämäläinen, I.S. Honkala, M.K. Kaikkonen, S. Litsyn, Bounds for binary multiple covering codes, Designs, Codes and Cryptography 3 (1993) 251-275.
4. T.W. Haynes, S.T. Hedetniemi, P.J. Slater, Domination in Graphs, Marcel Dekker, New York, 1998.
5. 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.
6. M.G. Karpovsky, K. Chakrabarty, L.B. Levitin, D.R. Avresky, On the covering of vertices for fault diagnosis in hypercubes, Inform. Process. Lett. 69 (1999) 99-103.
7. N.J.A. Sloane, S.M. Reddy, C.L. Chen, New binary codes, IEEE Trans. Inform. Theory 18 (1972) 503-510.
8. G.V. Zaitsev, V.A. Zinoviev, N.V. Semakov, Interrelation of Preparata and hamming codes and extension of Hamming codes to new double-error-correcting codes, Proceedings of the Second International Symposium on Information Theory, Tsahkadsor, Armenia, USSR, 1971, Akademiai Kiado, Budapest, 1973.