A4 Vertaisarvioitu artikkeli konferenssijulkaisussa
New lower bounds for identifying codes in infinite grids
Tekijät: Junnila V, Laihonen T
Julkaisuvuosi: 2012
Journal: IEEE International Symposium on Information Theory
Tietokannassa oleva lehden nimi: 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)
Lehden akronyymi: IEEE INT SYMP INFO
Aloitussivu: 676
Lopetussivu: 680
Sivujen määrä: 5
ISSN: 2157-8095
Tiivistelmä
Moreover, there exists a 2-identifying code in the hexagonal grid with density 4/19 approximate to 0.211. Currently, the best known lower bound for this case is 1/5 = 0.2 by Martin and Stanton (2010). We improve this lower bound to 4/19, i.e. show that the construction with density 4/19 is optimal.
Moreover, there exists a 2-identifying code in the hexagonal grid with density 4/19 approximate to 0.211. Currently, the best known lower bound for this case is 1/5 = 0.2 by Martin and Stanton (2010). We improve this lower bound to 4/19, i.e. show that the construction with density 4/19 is optimal.
Turun yliopiston Tutkimustietojärjestelmän portaali