On identifying codes in binary hamming spaces

Journal of Combinatorial Theory. Series A

Volumn 99, Issue 2, 2002, Pages 232-243

  Honkala, Iiro ^a   Lobstein, Antoine ^b  

^a UNIVERSITY OF TURKU   (Finland)

^b CNRS   (France)

Author keywords

Complexity; Covering codes; Hamming space; Identifying codes

Indexed keywords

EID: 0036050618     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.2002.3263     Document Type: Article

References (27)

1. Balancing sets of vectors
2. "Algorithmic Complexity and Communication Problems"
3. On binary codes for identification
4. Bounds on identifying codes
5. A nonconstructive upper bound on covering radius
6. On tilings of the binary vector space
7. Good coverings of Hamming spaces with spheres
8. "Covering Codes"
9. Do most binary linear codes achieve the Goblick bound on the covering radius?
10. Computational results on identifying t-codes
11. Linear codes with covering radius 2 and other new covering codes
12. "Computers and Intractability, a Guide to the Theory of NP-Completeness"
13. "Fundamentals of Domination in Graphs"
14. On the identifying radius of codes
15. On codes identifying sets of vertices in Hamming spaces
16. On strongly identifying codes
17. On the complexity of the identification problem in Hamming spaces
18. Unit sphere packings and coverings of the Hamming space
19. On a new class of codes for identifying vertices in graphs
20. Optimal codes for strong identification
21. Sequences of optimal identifying codes
22. Families of optimal codes for strong identification
23. "Introduction to Coding Theory"
24. "The Theory of Error-Correcting Codes"
25. The complexity of computing the covering radius of a code
26. Two families of optimal identifying codes in binary Hamming spaces
27. "Covering codes"