{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:17Z","timestamp":1759637897023},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667230"},{"type":"electronic","value":"9783540467960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46796-3_14","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T11:14:33Z","timestamp":1186053273000},"page":"142-147","source":"Crossref","is-referenced-by-count":2,"title":["On the Size of Identifying Codes"],"prefix":"10.1007","author":[{"given":"Uri","family":"Blass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iiro","family":"Honkala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"U. Blass, I. Honkala, S. Litsyn: Bounds on identifying codes. Discrete Mathematics, to appear","DOI":"10.1016\/S0012-365X(01)00113-3"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"U. Blass, I. Honkala, S. Litsyn: On binary codes for identification. Journal of Combinatorial Designs, submitted","DOI":"10.1002\/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-S"},{"key":"14_CR3","volume-title":"Covering Codes","author":"G. Cohen","year":"1997","unstructured":"G. Cohen, I. Honkala, S. Litsyn, A. Lobstein: Covering Codes. Elsevier, Amsterdam (1997)"},{"key":"14_CR4","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"}],"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-46796-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T21:33:32Z","timestamp":1550439212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46796-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667230","9783540467960"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-46796-3_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}