{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T09:46:57Z","timestamp":1772358417992,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3638,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0166-218x(02)00579-6","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T15:29:34Z","timestamp":1060702174000},"page":"409-419","source":"Crossref","is-referenced-by-count":11,"title":["Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori"],"prefix":"10.1016","volume":"129","author":[{"given":"Iiro","family":"Honkala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark G.","family":"Karpovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00579-6_BIB1","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0012-365X(01)00113-3","article-title":"Bounds on identifying codes","volume":"241","author":"Blass","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00579-6_BIB2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-S","article-title":"On binary codes for identification","volume":"8","author":"Blass","year":"2000","journal-title":"J. Combin. Designs"},{"key":"10.1016\/S0166-218X(02)00579-6_BIB3","doi-asserted-by":"crossref","unstructured":"K. Chakrabarty, D.R. Avresky and D.R. Kaeli, Fault isolation and diagnosis in multiprocessor systems with point-to-point connections, in: Fault Tolerant Parallel and Distributed Systems, Kluwer Academic Publishers, Dordrecht, 1998, pp. 285\u2013301.","DOI":"10.1007\/978-1-4615-5449-3_16"},{"issue":"1","key":"10.1016\/S0166-218X(02)00579-6_BIB4","doi-asserted-by":"crossref","first-page":"R39","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":"10.1016\/S0166-218X(02)00579-6_BIB5","doi-asserted-by":"crossref","unstructured":"I. Charon, I. Honkala, O. Hudry, A. Lobstein, The minimum density of an identifying code in the king lattice, Discrete Math., accepted for publication.","DOI":"10.1016\/S0012-365X(03)00306-6"},{"issue":"1","key":"10.1016\/S0166-218X(02)00579-6_BIB6","doi-asserted-by":"crossref","first-page":"R11","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":"10.1016\/S0166-218X(02)00579-6_BIB7","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1137\/S0895480199360990","article-title":"Bounds for codes identifying vertices in the hexagonal grid","volume":"13","author":"Cohen","year":"2000","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00579-6_BIB8","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/12.908992","article-title":"On codes identifying vertices in the two-dimensional square lattice with diagonals","volume":"50","author":"Cohen","year":"2001","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(02)00579-6_BIB9","doi-asserted-by":"crossref","unstructured":"G. Cohen, I. Honkala, A. Lobstein, G. Z\u00e9mor, On identifying codes, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Proceedings of the DIMACS Workshop on Codes and Association Schemes, AMS, Providence, RI, 2001, pp. 97\u2013109.","DOI":"10.1090\/dimacs\/056\/07"},{"key":"10.1016\/S0166-218X(02)00579-6_BIB10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1011256721935","article-title":"On codes identifying sets of vertices in Hamming spaces","volume":"24","author":"Honkala","year":"2001","journal-title":"Designs, Codes Cryptography"},{"key":"10.1016\/S0166-218X(02)00579-6_BIB11","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","article-title":"On a new class of codes for identifying vertices in graphs","volume":"44","author":"Karpovsky","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00579-6_BIB12","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1109\/18.986043","article-title":"Sequences of optimal identifying codes","volume":"48","author":"Laihonen","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00579-6_BIB13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0166-218X(01)00248-7","article-title":"Families of optimal codes for strong identification","volume":"121","author":"Laihonen","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00579-6_BIB14","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1109\/18.995650","article-title":"Two families of optimal identifying codes in binary Hamming spaces","volume":"48","author":"Ranto","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00579-6_BIB15","unstructured":"Rosen, K.H. (Ed.), Handbook of Discrete and Combinatorial Mathematics, CRC Press, Boca Raton, FL, 2000."},{"key":"10.1016\/S0166-218X(02)00579-6_BIB16","series-title":"Parallel and Distributed Processing","first-page":"714","article-title":"Fault-tolerant message routing for multiprocessors","author":"Zakrevski","year":"1998"},{"key":"10.1016\/S0166-218X(02)00579-6_BIB17","unstructured":"L. Zakrevski, M.G. Karpovsky, Fault-tolerant message routing in computer networks, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, Nevada, USA, 1999, pp. 2279\u20132287."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005796?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005796?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T07:06:50Z","timestamp":1585120010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02005796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":17,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0166218X02005796"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00579-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}