On Codes Identifying Sets of Vertices in Hamming Spaces
Designs, Codes and Cryptography
Exact Minimum Density of Codes Identifying Vertices in the Square Grid
SIAM Journal on Discrete Mathematics
A linear algorithm for minimum 1-identifying codes in oriented trees
Discrete Applied Mathematics
European Journal of Combinatorics
Monotonicity of the minimum cardinality of an identifying code in the hypercube
Discrete Applied Mathematics
Locating sensors in paths and cycles: The case of 2-identifying codes
European Journal of Combinatorics
New bounds on binary identifying codes
Discrete Applied Mathematics
On a new class of codes for identifying vertices in graphs
IEEE Transactions on Information Theory
Robust location detection with sensor networks
IEEE Journal on Selected Areas in Communications
An optimal result for codes identifying sets of words
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On the size of identifying codes in triangle-free graphs
Discrete Applied Mathematics
Identifying codes of the direct product of two cliques
European Journal of Combinatorics
| Hi-index | 0.02 |
In this paper, we consider identifying codes in binary Hamming spaces F^n, i.e., in binary hypercubes. The concept of (r,=~1nlog"2M"r^(^==1 when @r@?[0,1/2). We also show that M"r^(^=