Discrete Mathematics
On Codes Identifying Sets of Vertices in Hamming Spaces
Designs, Codes and Cryptography
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
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
On robust identification in the square and king grids
Discrete Applied Mathematics
On identifying codes that are robust against edge changes
Information and Computation
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
Fault diagnosis of multiprocessor systems gives the motivation for identifying codes. In this paper we provide an infinite sequence of optimal strongly (1, ≤ l)-identifying codes in Hamming spaces for every l when l ≥ 3.