On the identification of sets of points in the square lattice

: Honkala I, Laihonen T

Publisher: SPRINGER-VERLAG

: 2003

: Discrete and Computational Geometry

: DISCRETE & COMPUTATIONAL GEOMETRY

: DISCRETE COMPUT GEOM

: 29

: 1

: 139

: 152

: 14

: 0179-5376

DOI: https://doi.org/10.1007/s00454-002-0730-2

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.

Mathematics