Sequences of optimal identifying codes

IEEE Transactions on Information Theory

Volumn 48, Issue 3, 2002, Pages 774-776

  Laihonen, Tero K ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

Binary Hamming space; Binary hypercube; Covering code; Identifying code; Optimal code

Indexed keywords

MULTIPROCESSING SYSTEMS; SET THEORY; THEOREM PROVING; VECTORS;

OPTIMAL IDENTIFYING CODES;

BINARY CODES;

EID: 0036495826     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.986043     Document Type: Article

References (14)

1. Bounds on identifying codes
2. On binary codes for identification
3. General bounds for identifying codes in some infinite regular graphs
4. On identifying codes
5. On the identifying radius of codes
6. On codes identifying sets of vertices in Hamming spaces
7. On strongly identifying codes
8. Codes for strong identification
9. On a new class of codes for identifying vertices in graphs
10. Families of optimal codes for strong identification
11. A coloring problem in Hamming spaces
12. Two families of optimal identifying codes in binary Hamming spaces