Abstract. Identifying codes in the square lattice are considered. The motivation for these codes is the following: if a multiprocessor system is modelled by the square lattice, then we can locate faulty processors in the system with the aid of identifying codes. Constructions, some of which are optimal, are given.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Honkala, ., Laihonen, . On the Identification of Sets of Points in the Square Lattice . Discrete Comput Geom 29, 139–152 (2002). https://doi.org/10.1007/s00454-002-0730-2
Issue Date:
DOI: https://doi.org/10.1007/s00454-002-0730-2