A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On the identification of sets of points in the square lattice
Tekijät: Honkala I, Laihonen T
Kustantaja: SPRINGER-VERLAG
Julkaisuvuosi: 2003
Journal: Discrete and Computational Geometry
Tietokannassa oleva lehden nimi: DISCRETE & COMPUTATIONAL GEOMETRY
Lehden akronyymi: DISCRETE COMPUT GEOM
Vuosikerta: 29
Numero: 1
Aloitussivu: 139
Lopetussivu: 152
Sivujen määrä: 14
ISSN: 0179-5376
DOI: https://doi.org/10.1007/s00454-002-0730-2
Tiivistelmä
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.
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.
Turun yliopiston Tutkimustietojärjestelmän portaali