{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:08Z","timestamp":1740122588962,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004022","name":"Jenny ja Antti Wihurin Rahasto","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004022","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"crossref","award":["338797"],"award-info":[{"award-number":["338797"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003125","name":"Suomen Kulttuurirahasto","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003125","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10623-021-00963-8","type":"journal-article","created":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T17:33:26Z","timestamp":1635874406000},"page":"67-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved lower bound for locating-dominating codes in binary Hamming spaces"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6891-7902","authenticated-orcid":false,"given":"Ville","family":"Junnila","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2688-2166","authenticated-orcid":false,"given":"Tero","family":"Laihonen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2940-8088","authenticated-orcid":false,"given":"Tuomo","family":"Lehtil\u00e4","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,2]]},"reference":[{"issue":"5","key":"963_CR1","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1016\/j.ejc.2009.11.012","volume":"31","author":"D Auger","year":"2010","unstructured":"Auger D.: Minimal identifying codes in trees and planar graphs with large girth. Eur. J. Comb. 31(5), 1372\u20131384 (2010).","journal-title":"Eur. J. Comb."},{"issue":"2","key":"963_CR2","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.ejc.2009.03.032","volume":"31","author":"I Charon","year":"2010","unstructured":"Charon I., Cohen G., Hudry O., Lobstein A.: New identifying codes in the binary Hamming space. Eur. J. Comb. 31(2), 491\u2013501 (2010).","journal-title":"Eur. J. Comb."},{"key":"963_CR3","doi-asserted-by":"crossref","unstructured":"Foucaud F., Heydarshahi S., Parreau A.: Domination and location in twin-free digraphs. Discret. Appl. Math. (2020).","DOI":"10.1016\/j.dam.2020.03.025"},{"key":"963_CR4","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes T.W., Hedetniemi S.T., Slater P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)."},{"key":"963_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.dam.2018.09.034","volume":"263","author":"C Hernando","year":"2019","unstructured":"Hernando C., Mora M., Pelayo I.M.: Locating domination in bipartite graphs and their complements. Discret. Appl. Math. 263, 195\u2013203 (2019).","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"963_CR6","first-page":"265","volume":"6","author":"I Honkala","year":"2004","unstructured":"Honkala I., Laihonen T., Ranto S.: On locating-dominating codes in binary Hamming spaces. Discret. Math. Theor. Comput. Sci. 6(2), 265 (2004).","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"963_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2018.09.034","volume":"767","author":"O Hudry","year":"2019","unstructured":"Hudry O., Lobstein A.: Unique (optimal) solutions: complexity results for identifying and locating-dominating codes. Theor. Comput. Sci. 767, 83\u2013102 (2019).","journal-title":"Theor. Comput. Sci."},{"key":"963_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.dam.2018.03.050","volume":"247","author":"V Junnila","year":"2018","unstructured":"Junnila V., Laihonen T., Lehtil\u00e4 T.: On regular and new types of codes for location-domination. Discret. Appl. Math. 247, 225\u2013241 (2018).","journal-title":"Discret. Appl. Math."},{"key":"963_CR9","doi-asserted-by":"crossref","unstructured":"Junnila V., Laihonen T., Lehtil\u00e4 T.: On a conjecture regarding identification in hamming graphs. Electron. J. Combin. P2, (2019).","DOI":"10.37236\/7828"},{"key":"963_CR10","unstructured":"Junnila V., Laihonen T., Lehtil\u00e4 T., Puertas M.L.: On stronger types of locating-dominating codes. Discret. Math. Theor. Comput. Sci. 21 (2019)."},{"issue":"4","key":"963_CR11","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/s12095-018-0316-3","volume":"11","author":"V Junnila","year":"2019","unstructured":"Junnila V., Laihonen T., Paris G.: Optimal bounds on codes for location in circulant graphs. Cryptogr. Commun. 11(4), 621\u2013640 (2019).","journal-title":"Cryptogr. Commun."},{"issue":"2","key":"963_CR12","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.661507","volume":"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 44(2), 599\u2013611 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"963_CR13","unstructured":"Lobstein A.: Watching systems, identifying, locating-dominating and discriminating codes in graphs: a bibliography. https:\/\/www.lri.fr\/%7Elobstein\/debutBIBidetlocdom.pdf."},{"key":"963_CR14","first-page":"97","volume":"45","author":"DF Rall","year":"1984","unstructured":"Rall D.F., Slater P.J.: On location-domination numbers for certain classes of graphs. Congr. Numer. 45, 97\u2013106 (1984).","journal-title":"Congr. Numer."},{"key":"963_CR15","unstructured":"Ranto S.: Identifying and locating-dominating codes in binary Hamming spaces. Turku Centre for Computer Science (2007)."},{"issue":"1","key":"963_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/net.3230170105","volume":"17","author":"PJ Slater","year":"1987","unstructured":"Slater P.J.: Domination and location in acyclic graphs. Networks 17(1), 55\u201364 (1987).","journal-title":"Networks"},{"issue":"4","key":"963_CR17","first-page":"445","volume":"22","author":"PJ Slater","year":"1988","unstructured":"Slater P.J.: Dominating and reference sets in a graph. J. Math. Phys. Sci. 22(4), 445\u2013455 (1988).","journal-title":"J. Math. Phys. Sci."},{"issue":"1\u20133","key":"963_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0012-365X(01)00244-8","volume":"249","author":"PJ Slater","year":"2002","unstructured":"Slater P.J.: Fault-tolerant locating-dominating sets. Discret. Math. 249(1\u20133), 179\u2013189 (2002).","journal-title":"Discret. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00963-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00963-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00963-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T07:19:00Z","timestamp":1641453540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00963-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,2]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["963"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00963-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2021,11,2]]},"assertion":[{"value":"23 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}