A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On identifying codes in the triangular and square grids
Tekijät: Honkala I, Laihonen T
Kustantaja: SIAM PUBLICATIONS
Julkaisuvuosi: 2004
Lehti:SIAM Journal on Computing
Tietokannassa oleva lehden nimiSIAM JOURNAL ON COMPUTING
Lehden akronyymi: SIAM J COMPUT
Vuosikerta: 33
Numero: 2
Aloitussivu: 304
Lopetussivu: 312
Sivujen määrä: 9
ISSN: 0097-5397
DOI: https://doi.org/10.1137/S0097539703433110
Tiivistelmä
It is shown that in the infinite square grid the density of every (r,less than or equal to 2)-identifying code is at least 1/8 and that there exists a sequence C-r of (r, less than or equal to 2)-identifying codes such that the density of C-r tends to 1/8 when r --> infinity. In the infinite triangular grid a sequence C'(r) of (r, less than or equal to 2)-identifying codes is given such that the density of C'(r) tends to 0 when r --> infinity.
It is shown that in the infinite square grid the density of every (r,less than or equal to 2)-identifying code is at least 1/8 and that there exists a sequence C-r of (r, less than or equal to 2)-identifying codes such that the density of C-r tends to 1/8 when r --> infinity. In the infinite triangular grid a sequence C'(r) of (r, less than or equal to 2)-identifying codes is given such that the density of C'(r) tends to 0 when r --> infinity.
Turun yliopiston Tutkimustietojärjestelmän portaali