On the identification of sets of points in the square lattice

DOI10.1007/s00454-002-0730-2zbMath1024.94018OpenAlexW2071438320MaRDI QIDQ1864133

Tero Laihonen, Iiro S. Honkala

Publication date: 17 March 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-002-0730-2

zbMATH Keywords

faulty processorsidentifying codessquare lattice

Mathematics Subject Classification ID

Applications of graph theory (05C90) Fault detection; testing in circuits and networks (94C12) Combinatorial codes (94B25)

Related Items

On a new class of identifying codes in graphs ⋮ On robust identification in the square and King grids ⋮ Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice ⋮ Identification in \(\mathbb Z^2\) using Euclidean balls ⋮ On the identification problems in products of cycles ⋮ Adaptive identification in graphs ⋮ Extension of universal cycles for globally identifying colorings of cycles ⋮ Liar's domination ⋮ On identification in the triangular grid