A family of optimal identifying codes in Z^2

DOI10.1016/J.JCTA.2006.03.011MaRDI QIDQ855875zbMATHOpenAlexFDO

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

zbMATH Keywords

graphdensity

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05) Other types of codes (94B60)

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

Cites work

• An optimal edge-robust identifying code in the triangular lattice
• General bounds for identifying codes in some infinite regular graphs
• Identifying codes with small radius in some infinite regular graphs
• On a new class of codes for identifying vertices in graphs
• On identifying codes in binary Hamming spaces
• On robust and dynamic identifying codes
• Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
• The minimum density of an identifying code in the king lattice.

Cited in

(8)

• Identification in \(\mathbb Z^2\) using Euclidean balls
• On vertex-robust identifying codes of level three.
• An optimal edge-robust identifying code in the triangular lattice
• Minimum-Density Identifying Codes in Square Grids
• Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
• On identifying codes that are robust against edge changes
• On 2-edge robust \(r\)-identifying codes in the king grid
• Tolerant identification with Euclidean balls

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)