Discrete Mathematics
On Codes Identifying Sets of Vertices in Hamming Spaces
Designs, Codes and Cryptography
Optimal codes for strong identification
European Journal of Combinatorics
Families of optimal codes for strong identification
Discrete Applied Mathematics
On a new class of codes for identifying vertices in graphs
IEEE Transactions on Information Theory
Sequences of optimal identifying codes
IEEE Transactions on Information Theory
Two families of optimal identifying codes in binary Hamming spaces
IEEE Transactions on Information Theory
Constructing codes identifying sets of vertices
Designs, Codes and Cryptography
On graphs on n vertices having an identifying code of cardinality ⌈log2(n + 1)⇸
Discrete Applied Mathematics
On cages admitting identifying codes
European Journal of Combinatorics
Adaptive identification in graphs
Journal of Combinatorial Theory Series A
Partial linear spaces and identifying codes
European Journal of Combinatorics
The minimum identifying code graphs
Discrete Applied Mathematics
Watching systems in graphs: An extension of identifying codes
Discrete Applied Mathematics
| Hi-index | 0.00 |
We consider identifying and strongly identifying codes. Finding faulty processors in a multiprocessor system gives the motivation for these codes. Constructions and lower bounds on these codes are given.We provide two infinite families of optimal (1, 驴 2)-identifying codes, which can find malfunctioning processors in a binary hypercube F2n. Also two infinite families of optimal codes are given in the corresponding case of strong identification. Some results on more general graphs are as well provided.