A family of optimal identifying codes in \(\mathbb Z^2\)
From MaRDI portal
Publication:855875
DOI10.1016/j.jcta.2006.03.011zbMath1109.94008OpenAlexW2095154901MaRDI QIDQ855875
Publication date: 7 December 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2006.03.011
Applications of graph theory (05C90) Linear codes (general theory) (94B05) Other types of codes (94B60)
Related Items (2)
On identifying codes that are robust against edge changes ⋮ Minimum-Density Identifying Codes in Square Grids
Cites Work
- On identifying codes in binary Hamming spaces
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- The minimum density of an identifying code in the king lattice.
- An optimal edge-robust identifying code in the triangular lattice
- On robust and dynamic identifying codes
- On a new class of codes for identifying vertices in graphs
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs
This page was built for publication: A family of optimal identifying codes in \(\mathbb Z^2\)