A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On identifying codes in the hexagonal mesh
Tekijät: Honkala I, Laihonen T
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 2004
Journal: Information Processing Letters
Tietokannassa oleva lehden nimi: INFORMATION PROCESSING LETTERS
Lehden akronyymi: INFORM PROCESS LETT
Vuosikerta: 89
Numero: 1
Aloitussivu: 9
Lopetussivu: 14
Sivujen määrä: 6
ISSN: 0020-0190
DOI: https://doi.org/10.1016/j.ipl.2003.09.009
Tiivistelmä
It is shown that, if r greater than or equal to 2, there exists an (r, less than or equal to 2)-identifying code in the infinite hexagonal mesh with density (5r + 2)/((r + 2)(2r + 1)) for even r and (5r + 1)/((dr + 1)(2r + 1)) for odd r. The optimal density of a (1, less than or equal to 2)-identifying code in the infinite hexagonal mesh is shown to be 2/3 and the optimal densities of (1, less than or equal to 3)- and (2, less than or equal to 3)-identifying codes are shown to be 1. (C) 2003 Elsevier B.V. All rights reserved.
It is shown that, if r greater than or equal to 2, there exists an (r, less than or equal to 2)-identifying code in the infinite hexagonal mesh with density (5r + 2)/((r + 2)(2r + 1)) for even r and (5r + 1)/((dr + 1)(2r + 1)) for odd r. The optimal density of a (1, less than or equal to 2)-identifying code in the infinite hexagonal mesh is shown to be 2/3 and the optimal densities of (1, less than or equal to 3)- and (2, less than or equal to 3)-identifying codes are shown to be 1. (C) 2003 Elsevier B.V. All rights reserved.
Turun yliopiston Tutkimustietojärjestelmän portaali