On vertex-robust identifying codes of level three.

MaRDI QIDQ3094530zbMATHFDO

Authors Tero Laihonen, Iiro Honkala

Publication date 25 October 2011

zbMATH Keywords

identifying codecovering codebinary hypercubeinfinite gridvertex robustness

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• A family of optimal identifying codes in \(\mathbb Z^2\)
• On 2-edge robust \(r\)-identifying codes in the king grid
• General bounds for identifying codes in some infinite regular graphs
• On robust and dynamic identifying codes
• Identifying codes with small radius in some infinite regular graphs

Cited in

(5)

• On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
• Tolerant location detection in sensor networks
• On Iiro Honkala's contributions to identifying codes
• A family of optimal identifying codes in \(\mathbb Z^2\)
• On identifying codes that are robust against edge changes

This page was built for publication: On vertex-robust identifying codes of level three.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094530)