New lower bounds for identifying codes in infinite grids

: Junnila V, Laihonen T

: 2012

: IEEE International Symposium on Information Theory

: 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)

: IEEE INT SYMP INFO

: 676

: 680

: 5

: 2157-8095

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.