Optimal lower bound for 2-identifying codes in the hexagonal grid
From MaRDI portal
Publication:456287
zbMath1252.05177arXiv1202.0670MaRDI QIDQ456287
Publication date: 24 October 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.0670
Combinatorics in computer science (68R05) Bounds on codes (94B65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fault detection; testing in circuits and networks (94C12)
Related Items (5)
Identifying codes in the complementary prism of cycles ⋮ New lower bound for 2-identifying code in the square grid ⋮ New bounds on the minimum density of an identifying code for the infinite hexagonal grid ⋮ Locating-Domination and Identification ⋮ Minimum-Density Identifying Codes in Square Grids
This page was built for publication: Optimal lower bound for 2-identifying codes in the hexagonal grid
