A family of optimal identifying codes in Z^2
From MaRDI portal
Publication:855875
DOI10.1016/J.JCTA.2006.03.011zbMATH Open1109.94008OpenAlexW2095154901MaRDI QIDQ855875FDOQ855875
Authors: Iiro Honkala 
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
Recommendations
- On 2-edge robust \(r\)-identifying codes in the king grid
- An optimal edge-robust identifying code in the triangular lattice
- On vertex-robust identifying codes of level three.
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- On identifying codes in the King grid that are robust against edge deletions
Applications of graph theory (05C90) Linear codes (general theory) (94B05) Other types of codes (94B60)
Cites Work
- On a new class of codes for identifying vertices in graphs
- On identifying codes in binary Hamming spaces
- The minimum density of an identifying code in the king lattice.
- Identifying codes with small radius in some infinite regular graphs
- On robust and dynamic identifying codes
- General bounds for identifying codes in some infinite regular graphs
- An optimal edge-robust identifying code in the triangular lattice
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
Cited In (6)
- Minimum-Density Identifying Codes in Square Grids
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- On 2-edge robust \(r\)-identifying codes in the king grid
- An optimal edge-robust identifying code in the triangular lattice
- Identification in \(\mathbb Z^2\) using Euclidean balls
- On identifying codes that are robust against edge changes
This page was built for publication: A family of optimal identifying codes in \(\mathbb Z^2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855875)
