Discrete Mathematics
Monotonicity of the minimum cardinality of an identifying code in the hypercube
Discrete Applied Mathematics
New identifying codes in the binary Hamming space
European Journal of Combinatorics
Improved bounds on identifying codes in binary Hamming spaces
European Journal of Combinatorics
On a new class of codes for identifying vertices in graphs
IEEE Transactions on Information Theory
Optimal linear identifying codes
IEEE Transactions on Information Theory
Improved Upper Bounds on Binary Identifying Codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A subspace C of the binary Hamming space F n of length n is called a linear r-identifying code if for all vectors of F n the intersections of C and closed r-radius neighbourhoods are nonempty and different. In this paper, we give lower bounds for such linear codes. For radius r = 2, we give some general constructions. We give many (optimal) constructions which were found by a computer search. New constructions improve some previously known upper bounds for r-identifying codes in the case where linearity is not assumed.