Bounds on the minimum size of self-identifying codes in K_m × P_n and K_m × C_n are linear in n with m-dependent coefficients and asymptotically tight.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Self-identifying codes in direct products of complete graphs with paths and cycles
Bounds on the minimum size of self-identifying codes in K_m × P_n and K_m × C_n are linear in n with m-dependent coefficients and asymptotically tight.