Two families of optimal identifying codes in binary Hamming spaces

IEEE Transactions on Information Theory

Volumn 48, Issue 5, 2002, Pages 1200-1203

  Ranto, Sanna M ^b   Honkala, Iiro S ^a,c   Laihonen, Tero K ^c  

^a IEEE   (Finland)

^b TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^c UNIVERSITY OF TURKU   (Finland)

Author keywords

Binary codes; Code construction; Hamming space; Identifying codes; Optimal identifying codes

Indexed keywords

OPTIMAL IDENTIFYING CODES;

GRAPH THEORY; MULTIPROCESSING SYSTEMS; SET THEORY; THEOREM PROVING;

BINARY CODES;

EID: 0036567043     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.995650     Document Type: Article

References (12)

1. On a new class of codes for identifying vertices in graphs
2. Bounds on identifying codes
3. On binary codes for identification
4. On the identifying radius of codes
5. On codes identifying sets of vertices in Hamming spaces
6. Improved identifying codes for the grid
7. New bounds for codes identifying vertices in graphs
8. On codes identifying vertices in the two-dimensional square lattice with diagonals
9. Bounds for codes identifying vertices in the hexagonal grid
10. On identifying codes