{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:08:10Z","timestamp":1766066890612},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,14]],"date-time":"2018-06-14T00:00:00Z","timestamp":1528934400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"crossref","award":["ANR-14-CE25-0006"],"award-info":[{"award-number":["ANR-14-CE25-0006"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s12095-018-0316-3","type":"journal-article","created":{"date-parts":[[2018,6,14]],"date-time":"2018-06-14T07:35:10Z","timestamp":1528961710000},"page":"621-640","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimal bounds on codes for location in circulant graphs"],"prefix":"10.1007","volume":"11","author":[{"given":"Ville","family":"Junnila","sequence":"first","affiliation":[]},{"given":"Tero","family":"Laihonen","sequence":"additional","affiliation":[]},{"given":"Gabrielle","family":"Paris","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,14]]},"reference":[{"issue":"1","key":"316_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1137\/S0895480104444089","volume":"19","author":"Y Ben-Haim","year":"2005","unstructured":"Ben-Haim, Y., Litsyn, S.: Exact minimum density of codes identifying vertices in the square grid. SIAM J. Discret. Math. 19(1), 69\u201382 (2005)","journal-title":"SIAM J. Discret. Math."},{"issue":"7","key":"316_CR2","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/j.ejc.2003.12.013","volume":"25","author":"N Bertrand","year":"2004","unstructured":"Bertrand, N., Charon, I., Hudry, O., Lobstein, A.: Identifying and locating-dominating codes on chains and cycles. Eur. J. Comb. 25(7), 969\u2013987 (2004)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"316_CR3","doi-asserted-by":"crossref","first-page":"Research Paper","DOI":"10.37236\/1628","volume":"9","author":"I Charon","year":"2002","unstructured":"Charon, I., Hudry, O., Lobstein, A.: Identifying codes with small radius in some infinite regular graphs. Electron. J. Combin. 9(1), Research Paper 11 (2002)","journal-title":"Electron. J. Combin."},{"issue":"15","key":"316_CR4","doi-asserted-by":"publisher","first-page":"1540","DOI":"10.1016\/j.dam.2011.06.008","volume":"159","author":"C Chen","year":"2011","unstructured":"Chen, C., Lu, C., Miao, Z.: Identifying codes and locating-dominating sets on paths and cycles. Discret. Appl. Math. 159(15), 1540\u20131547 (2011)","journal-title":"Discret. Appl. Math."},{"key":"316_CR5","doi-asserted-by":"crossref","first-page":"Research Paper","DOI":"10.37236\/1451","volume":"6","author":"G Cohen","year":"1999","unstructured":"Cohen, G., Gravier, S., Honkala, I., Lobstein, A., Mollard, M., Payan, C., Z\u00e9mor, G.: Improved identifying codes for the grid. Electron. J. Combin. 6, Research Paper 19, Comment (1999)","journal-title":"Electron. J. Combin."},{"issue":"2","key":"316_CR6","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/12.908992","volume":"50","author":"G Cohen","year":"2001","unstructured":"Cohen, G., Honkala, I., Lobstein, A., Z\u00e9mor, G.: On codes identifying vertices in the two-dimensional square lattice with diagonals. IEEE Trans. Comput. 50 (2), 174\u2013176 (2001)","journal-title":"IEEE Trans. Comput."},{"key":"316_CR7","first-page":"177","volume":"49","author":"G Exoo","year":"2011","unstructured":"Exoo, G., Junnila, V., Laihonen, T.: Locating-dominating codes in cycles. Australas. J. Combin. 49, 177\u2013194 (2011)","journal-title":"Australas. J. Combin."},{"issue":"13-14","key":"316_CR8","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1016\/j.dam.2013.03.008","volume":"161","author":"M Ghebleh","year":"2013","unstructured":"Ghebleh, M., Niepel, L.: Locating and identifying codes in circulant networks. Discret. Appl. Math. 161(13-14), 2001\u20132007 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"316_CR9","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/j.ejc.2004.09.005","volume":"27","author":"S Gravier","year":"2006","unstructured":"Gravier, S., Moncel, J., Semri, A.: Identifying codes of cycles. Eur. J. Comb. 27(5), 767\u2013776 (2006)","journal-title":"Eur. J. Comb."},{"issue":"21","key":"316_CR10","doi-asserted-by":"publisher","first-page":"2670","DOI":"10.1016\/j.disc.2006.04.028","volume":"306","author":"I Honkala","year":"2006","unstructured":"Honkala, I.: An optimal locating-dominating set in the infinite triangular grid. Discret. Math. 306(21), 2670\u20132681 (2006)","journal-title":"Discret. Math."},{"issue":"2","key":"316_CR11","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.ejc.2004.09.002","volume":"27","author":"I Honkala","year":"2006","unstructured":"Honkala, I., Laihonen, T.: On locating-dominating sets in infinite grids. Eur. J. Comb. 27(2), 218\u2013227 (2006)","journal-title":"Eur. J. Comb."},{"issue":"2-3","key":"316_CR12","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.ipl.2006.11.007","volume":"102","author":"I Honkala","year":"2007","unstructured":"Honkala, I., Laihonen, T.: On a new class of identifying codes in graphs. Inform. Process. Lett. 102(2-3), 92\u201398 (2007)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"316_CR13","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s00373-011-1058-6","volume":"28","author":"V Junnila","year":"2012","unstructured":"Junnila, V., Laihonen, T.: Optimal identifying codes in cycles and paths. Graphs Combin. 28(4), 469\u2013481 (2012)","journal-title":"Graphs Combin."},{"key":"316_CR14","unstructured":"Junnila, V., Laihonen, T.: Collection of codes for tolerant location. In: Proceedings of the Bordeaux Graph Workshop, pp. 176\u2013179 (2016)"},{"key":"316_CR15","unstructured":"Junnila, V., Laihonen, T.: Tolerant location detection in sensor networks. Submitted (2016)"},{"key":"316_CR16","doi-asserted-by":"crossref","unstructured":"Junnila, V., Laihonen, T., Paris, G.: Solving two conjectures regarding codes for location in circulant graphs. Submitted (2017)","DOI":"10.1007\/s12095-018-0316-3"},{"issue":"2","key":"316_CR17","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. Inform. Theory 44(2), 599\u2013611 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"316_CR18","first-page":"309","volume":"101","author":"P Manuel","year":"2011","unstructured":"Manuel, P.: Locating and liar domination of circulant networks. Ars Combin. 101, 309\u2013320 (2011)","journal-title":"Ars Combin."},{"key":"316_CR19","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."},{"issue":"1","key":"316_CR20","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.ejc.2006.12.006","volume":"29","author":"DL Roberts","year":"2008","unstructured":"Roberts, D.L., Roberts, F.S.: Locating sensors in paths and cycles: The case of 2-identifying codes. Eur. J. Comb. 29(1), 72\u201382 (2008)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"316_CR21","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"},{"key":"316_CR22","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, 445\u2013455 (1988)","journal-title":"J. Math. Phys. Sci."},{"issue":"1\u20133","key":"316_CR23","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."},{"issue":"7","key":"316_CR24","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1016\/j.ejc.2007.09.006","volume":"29","author":"M Xu","year":"2008","unstructured":"Xu, M., Thulasiraman, K., Hu, X.-D.: Identifying codes of cycles with odd orders. Eur. J. Comb. 29(7), 1717\u20131720 (2008)","journal-title":"Eur. J. Comb."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0316-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-018-0316-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0316-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T14:45:58Z","timestamp":1604414758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-018-0316-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,14]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["316"],"URL":"https:\/\/doi.org\/10.1007\/s12095-018-0316-3","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,14]]},"assertion":[{"value":"19 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}