Discrete Mathematics
On Codes Identifying Sets of Vertices in Hamming Spaces
Designs, Codes and Cryptography
On a new class of codes for identifying vertices in graphs
IEEE Transactions on Information Theory
Two families of optimal identifying codes in binary Hamming spaces
IEEE Transactions on Information Theory
Optimal codes for strong identification
European Journal of Combinatorics
On the Identification of Vertices and Edges Using Cycles
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Codes Identifying Sets of Vertices
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
Discrete Applied Mathematics
On identifying codes that are robust against edge changes
Information and Computation
| Hi-index | 0.04 |
Codes for strong identification are considered. The motivation for these codes comes from locating faulty processors in a multiprocessor system. Constructions and lower bounds on these codes are given. In particular, we provide two infinite families of optimal strongly identifying codes, which can locate up to two malfunctioning processors in a binary hypercube.