On locating-dominating codes in binary hamming spaces

Discrete Mathematics and Theoretical Computer Science

Volumn 6, Issue 2, 2004, Pages 265-282

  Honkala, Iiro ^a   Laihonen, Tero ^a   Ranto, Sanna ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

Hamming space; Identifying codes; Locating dominating codes

Indexed keywords

EID: 30844458875     PISSN: 13658050     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. U. Blass, I. Honkala, and S. Litsyn: Bounds on identifying codes. Discrete Mathematics, 241(1-3):119-128, 2001.
2. U. Blass, I. Honkala, and S. Litsyn: On binary codes for identification. Journal of Combinatorial Designs, 8:151-156, 2000.
3. I. Charon, O. Hudry, and A. Lobstein: Identifying and locating-dominating codes: NP-completeness results for directed graphs. IEEE Transactions on Information Theory, 48(8):2192-2200, 2002.
4. I. Charon, O. Hudry, and A. Lobstein: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theoretical Computer Science, 290:2109-2120, 2003.
5. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein: Covering Codes. Elsevier, Amsterdam, 1997.
6. G. Cohen, I. Honkala, A. Lobstein, and G. Zémor: New bounds for codes identifying vertices in graphs. Electronic Journal of Combinatorics, 6(1)(R19), 1999.
7. G. D. Cohen, I. Honkala, A. Lobstein, and G. Zémor: On identifying codes. In A. Barg and S. Litsyn, editors, Codes and Association Schemes, Proceedings of the DIMACS Workshop on Codes and Association Schemes, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 56, AMS, Providence, pages 97-109, 2001.
8. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater: Fundamentals of Domination in Graphs. Marcel Dekker, New York, 1998.
9. I. Honkala, T. Laihonen, and S. Ranto: On codes identifying sets of vertices in Hamming spaces. Designs, Codes and Cryptography, 24:193-204, 2001.
10. I. Honkala and A. Lobstein: On identifying codes in binary Hamming spaces. Journal of Combinatorial Theory, Series A, 99(2):232-243, 2002.
11. I. Honkala and A. Lobstein: On the complexity of the identification problem in Hamming spaces. Acta Informatica, 38:839-845, 2002.
12. M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin: On a new class of codes for identifying vertices in graphs. IEEE Transactions on Information Theory, 44(2):599-611, 1998.
13. T. Laihonen: Sequences of optimal identifying codes. IEEE Transactions on Information Theory, 48(3):774-776, 2002.
14. T. Laihonen and S. Ranto: Codes identifying sets of vertices. In S. Boztaş and I. Shparlinski, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proceedings of AAECC-14, Lecture Notes in Computer Science 2227, Springer, Berlin, pages 82-91, 2001.
15. E. M. Rains and N. J. A. Sloane: Table of constant weight binary codes. Published electronically at http://www.research.att.com/∼njas/codes/Andw/.
16. D. F. Rall and P. J. Slater: On location-domination numbers for certain classes of graphs. Congressus Numerantium, 45:97-106, 1984.
17. S. Ranto: Optimal linear identifying codes. IEEE Transactions on Information Theory, 49:1544-1547, 2003.
18. S. Ranto, I. Honkala, and T. Laihonen: Two families of optimal identifying codes in binary Hamming spaces. IEEE Transactions on Information Theory, 48(5):1200-1203, 2002.
19. P. J. Slater: Dominating and reference sets in a graph. Journal Mathematical and Physical Sciences, 22:445-455, 1988.
20. P. J. Slater: Locating dominating sets and locating-dominating sets. In Y. Alavi and A. Schwenk, editors, Graph Theory, Combinatorics and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, volume 2, Wiley, pp. 1073-1079, 1995.
21. P. J. Slater: Fault-tolerant locating-dominating sets. Discrete Mathematics, 249(1-3):179-189, 2002.
22. G. J. M. van Wee: Improved sphere bounds on the covering radius of codes, IEEE Transactions on Information Theory, 34: 237-245, 1988.