Discrete Mathematics
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard
Theoretical Computer Science
Identifying codes in some subgraphs of the square lattice
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Identifying and locating-dominating codes on chains and cycles
European Journal of Combinatorics
On a new class of codes for identifying vertices in graphs
IEEE Transactions on Information Theory
Locating sensors in paths and cycles: The case of 2-identifying codes
European Journal of Combinatorics
Identifying codes of cycles with odd orders
European Journal of Combinatorics
On r-locating-dominating sets in paths
European Journal of Combinatorics
Note: On the size of identifying codes in binary hypercubes
Journal of Combinatorial Theory Series A
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
Improved bounds on identifying codes in binary Hamming spaces
European Journal of Combinatorics
Identifying codes and locating-dominating sets on paths and cycles
Discrete Applied Mathematics
On the size of identifying codes in triangle-free graphs
Discrete Applied Mathematics
Locating and identifying codes in circulant networks
Discrete Applied Mathematics
New results on variants of covering codes in Sierpiński graphs
Designs, Codes and Cryptography
Identifying codes of the direct product of two cliques
European Journal of Combinatorics
| Hi-index | 0.00 |
In this paper we deal with identifying codes in cycles. We show that for all r ≥ 1, any r-identifying code of the cycle Cn has cardinality at least gcd(2r + 1, n) ⌈n/2gcd(2r+ 1,n)⌉. This lower bound is enough to solve the case n even (which was already solved in [N. Bertrand, I. Charon, O. Hudry, A. Lobstein, Identifying and locating-dominating codes on chains and cycles, European Journal of Combinatorics 25 (7) (2004) 969-987]), but the case n odd seems to be more complicated. An upper bound is given for the case n odd, and some special cases are solved. Furthermore, we give some conditions on n and r to attain the lower bound.