{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:19Z","timestamp":1772283499239,"version":"3.50.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,12]],"date-time":"2009-11-12T00:00:00Z","timestamp":1257984000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s12095-009-0015-1","type":"journal-article","created":{"date-parts":[[2009,11,11]],"date-time":"2009-11-11T01:56:55Z","timestamp":1257904615000},"page":"41-47","source":"Crossref","is-referenced-by-count":6,"title":["New bounds for (r,\u2009\u2264\u20092)-identifying codes in the infinite king grid"],"prefix":"10.1007","volume":"2","author":[{"given":"Mikko","family":"Pelto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,12]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0012-365X(03)00306-6","volume":"276","author":"I Charon","year":"2004","unstructured":"Charon, I., Honkala, I., Hudry, O., Lobstein A.: The minimum density of an identifying code in the king lattice. Discrete Math. 276, 95\u2013109 (2004)","journal-title":"Discrete Math."},{"issue":"1","key":"15_CR2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.37236\/1628","volume":"9","author":"I Charon","year":"2002","unstructured":"Charon, I., Hudry, O., Lobstein, A.: Identifying codes with small radius in some infinite regular graphs. Electron. J. Comb. 9(1), R11 (2002)","journal-title":"Electron. J. Comb."},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/12.908992","volume":"50","author":"G Cohen","year":"2001","unstructured":"Cohen, G., Honkala, I., Lobstein, A., Z\u00e9mor, G.: On codes identifying vertices in the two-dimensional square lattice with diagonals. IEEE Trans. Comput. 50, 174\u2013176 (2001)","journal-title":"IEEE Trans. Comput."},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s00373-003-0531-2","volume":"19","author":"I Honkala","year":"2003","unstructured":"Honkala, I., Laihonen, T.: Codes for identification in the king lattice. Graphs Comb. 19, 505\u2013516 (2003)","journal-title":"Graphs Comb."},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/S0097539703433110","volume":"33","author":"I Honkala","year":"2004","unstructured":"Honkala, I., Laihonen, T.: On identifying codes in the triangular and square grids. SIAM J. Comput. 33, 304\u2013312 (2004)","journal-title":"SIAM J. Comput."},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.ipl.2006.11.007","volume":"102","author":"I Honkala","year":"2007","unstructured":"Honkala, I., Laihonen, T.: On a new class of identifying codes in graphs. Inf. Process. Lett. 102, 92\u201398 (2007)","journal-title":"Inf. Process. Lett."},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","volume":"IT-44","author":"MG Karpovsky","year":"1998","unstructured":"Karpovsky, M. G., Chakrabarty K., Levitin, L. B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory IT-44, 599\u2013611 (1998)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-009-0015-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-009-0015-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-009-0015-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,23]],"date-time":"2020-05-23T15:39:44Z","timestamp":1590248384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-009-0015-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,12]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["15"],"URL":"https:\/\/doi.org\/10.1007\/s12095-009-0015-1","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,12]]}}}