{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:21:51Z","timestamp":1759335711480},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429111"},{"type":"electronic","value":"9783540456247"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45624-4_9","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T23:23:35Z","timestamp":1180826615000},"page":"82-91","source":"Crossref","is-referenced-by-count":11,"title":["Codes Identifying Sets of Vertices"],"prefix":"10.1007","author":[{"given":"Tero","family":"Laihonen","sequence":"first","affiliation":[]},{"given":"Sanna","family":"Ranto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"U. Blass, I. Honkala, S. Litsyn: Bounds on identifying codes. Discrete Math., to appear","DOI":"10.1016\/S0012-365X(01)00113-3"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-S","volume":"8","author":"U. Blass","year":"2000","unstructured":"U. Blass, I. Honkala, S. Litsyn: On binary codes for identification. J. Combin. Des., 8 (2000) 151\u2013156","journal-title":"J. Combin. Des."},{"key":"9_CR3","unstructured":"I. Charon, I. Honkala, O. Hudry, A. Lobstein: General bounds for identifying codes in some infinite regular graphs. Electronic Journal of Combinatorics, submitted"},{"key":"9_CR4","volume-title":"Covering Codes","author":"G. Cohen","year":"1997","unstructured":"G. Cohen, I. Honkala, S. Litsyn, A. Lobstein: Covering Codes. Elsevier, Amsterdam, the Netherlands (1997)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"G. Cohen, I. Honkala, A. Lobstein, G. Z\u00e9mor: On identifying codes. In: Barg, A., Litsyn, S. (eds.): Codes and Association Schemes. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 56 (2001) 97\u2013109","DOI":"10.1090\/dimacs\/056\/07"},{"key":"9_CR6","unstructured":"G. Exoo: Computational results on identifying t-codes. preprint"},{"key":"9_CR7","unstructured":"I. Honkala: On the identifying radius of codes. Proceedings of the Seventh Nordic Combinatorial Conference, Turku, (1999) 39\u201343"},{"key":"9_CR8","unstructured":"I. Honkala: Triple systems for identifying quadruples. Australasian J. Combinatorics, to appear"},{"key":"9_CR9","unstructured":"I. Honkala, T. Laihonen, S. Ranto: On codes identifying sets of vertices in Hamming spaces. Des. Codes Cryptogr., to appear"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"I. Honkala, T. Laihonen, S. Ranto: On strongly identifying codes. Discrete Math., to appear","DOI":"10.1016\/S0012-365X(01)00357-0"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"I. Honkala, T. Laihonen, S. Ranto: Codes for strong identification. Electronic Notes in Discrete Mathematics, to appear","DOI":"10.1016\/S1571-0653(04)00177-5"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"M.G. Karpovsky","year":"1998","unstructured":"M.G. Karpovsky, K. Chakrabarty, L. B. Levitin, On a new class of codes for identifying vertices in graphs. IEEE Trans. Inform. Theory, 44 (1998) 599\u2013611","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"T. Laihonen: Sequences of optimal identifying codes. IEEE Trans. Inform. Theory, submitted","DOI":"10.1109\/18.986043"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"T. Laihonen: Optimal codes for strong identification, European J. Combinatorics, submitted","DOI":"10.1006\/eujc.2002.0571"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"T. Laihonen, S. Ranto: Families of optimal codes for strong identification. Discrete Appl. Math., to appear","DOI":"10.1016\/S0166-218X(01)00248-7"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"S. Ranto, I. Honkala, T. Laihonen: Two families of optimal identifying codes in binary Hamming spaces. IEEE Trans. Inform. Theory, submitted","DOI":"10.1109\/18.995650"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45624-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T03:01:24Z","timestamp":1550372484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45624-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429111","9783540456247"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45624-4_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}