On Codes Identifying Sets of Vertices in Hamming Spaces
Designs, Codes and Cryptography
Codes Identifying Sets of Vertices
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
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
Watching systems in graphs: An extension of identifying codes
Discrete Applied Mathematics
| Hi-index | 0.00 |
For all t 驴 2, we give an explicit construction of an infinite family of graphs such that G admits a code identifying sets of at most t vertices of G of cardinality O(t 2 ln |V(G)|) for all members G of the family. This beats the best previously known explicit construction by a factor of t 2.