{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:30:47Z","timestamp":1725485447108},"publisher-location":"Berlin, Heidelberg","reference-count":25,"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_32","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T23:23:35Z","timestamp":1180826615000},"page":"308-314","source":"Crossref","is-referenced-by-count":1,"title":["On the Identification of Vertices and Edges Using Cycles"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"U. Blass, I. Honkala, M. G. Karpovsky, S. Litsyn, Short dominating paths and cycles in binary hypercubes, Annals of Combinatorics, to appear.","DOI":"10.1007\/PL00001292"},{"key":"32_CR2","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":"32_CR3","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, Journal of Combinatorial Designs 8 (2000), 151\u2013156.","journal-title":"Journal of Combinatorial Designs"},{"key":"32_CR4","unstructured":"K. Chakrabarty, M. G. Karpovsky, L. B. Levitin, \u201cFault isolation and diagnosis in multiprocessor systems with point-to-point connections\u201d Fault tolerant parallel and distributed systems, Kluwer (1998), pp. 285\u2013301."},{"key":"32_CR5","unstructured":"I. Charon, O. Hudry, A. Lobstein, Identifying codes with small radius in some infinite regular graphs, Electronic Journal of Combinatorics, submitted."},{"key":"32_CR6","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":"32_CR7","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 Mathematics, submitted.","DOI":"10.1016\/S0012-365X(03)00306-6"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/12.908992","volume":"50","author":"G. Cohen","year":"2001","unstructured":"G. Cohen, I. Honkala, A. Lobstein, G. Z\u00e9mor, On codes identifying vertices in the two-dimensional square lattice with diagonals, IEEE Transactions on Computers 50 (2001), 174\u2013176.","journal-title":"IEEE Transactions on Computers"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1137\/S0895480199360990","volume":"13","author":"G. Cohen","year":"2000","unstructured":"G. Cohen, I. Honkala, A. Lobstein, G. Z\u00e9mor, Bounds for codes identifying vertices in the hexagonal grid, SIAM Journal on Discrete Mathematics 13 (2000), 492\u2013504.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"G. Cohen, I. Honkala, A. Lobstein, G. Z\u00e9mor, \u201cOn identifying codes,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Proceedings of the DIMACS Workshop on Codes and Association Schemes, November 9\u201312, 1999, pp. 97\u2013109.","DOI":"10.1090\/dimacs\/056\/07"},{"key":"32_CR11","unstructured":"I. Honkala, M. Karpovsky, S. Litsyn: Cycles for identifying vertices and edges in graphs, submitted."},{"key":"32_CR12","unstructured":"I. Honkala, T. Laihonen, S. Ranto, On codes identifying sets of vertices in Hamming spaces, Designs, Codes and Cryptography, to appear."},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"I. Honkala, T. Laihonen, S. Ranto, On strongly identifying codes, Discrete Mathematics, to appear.","DOI":"10.1016\/S0012-365X(01)00357-0"},{"key":"32_CR14","unstructured":"I. Honkala, A. Lobstein: On the density of identifying codes in the square lattice, submitted."},{"key":"32_CR15","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 Transactions on Information Theory 44 (1998), 599\u2013611.","journal-title":"IEEE Transactions on Information Theory"},{"key":"32_CR16","unstructured":"M. G. Karpovsky, S. M. Chaudhry, L. B. Levitin, Detection and location of given sets of errors by nonbinary linear codes, preprint."},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/12.262119","volume":"43","author":"M. G. Karpovsky","year":"1994","unstructured":"M. G. Karpovsky, L. B. Levitin, F. S. Vainstein, Diagnosis by signature analysis of test responses, IEEE Transactions on Computers 43 (1994), 1\u201312.","journal-title":"IEEE Transactions on Computers"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"M. G. Karpovsky, S. M. Chaudhry, L. B. Levitin, \u201cMultiple signature analysis: a framework for built-in self-diagnostic,\u201d Proceedings of the 22nd International Symposium on Fault-Tolerant Computing, July 8\u201310, 1992, Boston, Massachusetts (1992), pp. 112\u2013119.","DOI":"10.1109\/FTCS.1992.243609"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"T. Laihonen, Sequences of optimal identifying codes, IEEE Transactions on Information Theory, submitted.","DOI":"10.1109\/18.986043"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"T. Laihonen, Optimal codes for strong identification, European Journal of Combinatorics, submitted.","DOI":"10.1006\/eujc.2002.0571"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"T. Laihonen, S. Ranto, Families of optimal codes for strong identification, Discrete Applied Mathematics, to appear.","DOI":"10.1016\/S0166-218X(01)00248-7"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"S. Ranto, I. Honkala, T. Laihonen, Two families of optimal identifying codes in binary Hamming spaces, IEEE Transactions on Information Theory, submitted.","DOI":"10.1109\/18.995650"},{"volume-title":"Handbook of discrete and combinatorial mathematics","year":"2000","key":"32_CR23","unstructured":"Rosen, K. H. (ed.), Handbook of discrete and combinatorial mathematics, CRC Press, Boca Raton, 2000."},{"key":"32_CR24","unstructured":"L. Zakrevski, M. G. Karpovsky, \u201cFault-tolerant message routing in computer networks,\u201d Proc. Int. Conf. on Parallel and Distributed Processing Techniques and Applications (1999), pp. 2279\u20132287."},{"key":"32_CR25","unstructured":"L. Zakrevski, M. G. Karpovsky, \u201cFault-tolerant message routing for multiprocessors,\u201d Parallel and Distributed Processing J. Rolim (ed.), Springer (1998), pp. 714\u2013731."}],"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_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:30:51Z","timestamp":1556469051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45624-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429111","9783540456247"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45624-4_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}