{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:42:07Z","timestamp":1729651327631,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6284296","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T20:57:57Z","timestamp":1346360277000},"page":"676-680","source":"Crossref","is-referenced-by-count":1,"title":["New lower bounds for identifying codes in infinite grids"],"prefix":"10.1109","author":[{"given":"Ville","family":"Junnila","sequence":"first","affiliation":[]},{"given":"Tero","family":"Laihonen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"crossref","DOI":"10.37236\/394","article-title":"Lower bounds for identifying codes in some infinite grids","volume":"17","author":"martin","year":"2010","journal-title":"Electron J Combin"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/18.661507"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-008-0105-x"},{"key":"3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.37236\/1583","article-title":"General bounds for identifying codes in some infinite regular graphs","volume":"8","author":"charon","year":"2001","journal-title":"Electron J Combin"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2005.03.005"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480104444089"},{"journal-title":"Optimal Lower Bound for 2-identifying Code in the Hexagonal Grid","year":"0","author":"junnila","key":"10"},{"key":"7","doi-asserted-by":"crossref","first-page":"16","DOI":"10.37236\/202","article-title":"A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid","volume":"16","author":"cranston","year":"2009","journal-title":"Electron J Combin"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199360990"},{"key":"5","first-page":"3","article-title":"Improved identifying codes for the grid","volume":"6","author":"cohen","year":"1999","journal-title":"Electron J Combin"},{"key":"4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.37236\/1628","article-title":"Identifying codes with small radius in some infinite regular graphs","volume":"9","author":"charon","year":"2002","journal-title":"Electron J Combin"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.02.032"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2001.2106"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2012,7,1]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06284296.pdf?arnumber=6284296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T01:50:38Z","timestamp":1594605038000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6284296\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6284296","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}