{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T17:12:55Z","timestamp":1723223575508},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T00:00:00Z","timestamp":1539302400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry for Education, University and Research of Italy","award":["Project \u201dGeometrie di Galois e strutture di incidenza\u201d"]},{"name":"Italian National Group for Algebraic and Geometric Structures and their Applications"},{"name":"Russian Foundation for Sciences","award":["project 14-50-00150"]},{"name":"Ministry for Education, University and Research of Italy","award":["Project \u201dGeometrie di Galois e strutture di incidenza\u201d"]},{"name":"Ministry for Education, University and Research of Italy","award":["Project \u201dGeometrie di Galois e strutture di incidenza\u201d"]},{"name":"Ministry for Education, University and Research of Italy","award":["Project \u201dGeometrie di Galois e strutture di incidenza\u201d"]},{"name":"Italian National Group for Algebraic and Geometric Structures and their Applications"},{"name":"Italian National Group for Algebraic and Geometric Structures and their Applications"},{"name":"Italian National Group for Algebraic and Geometric Structures and their Applications"},{"DOI":"10.13039\/501100010607","name":"University of Perugia","doi-asserted-by":"crossref","award":["Projects \u201dConfigurazioni Geometriche e Superfici Altamente Simmetriche\u201d and \u201dCodici lineari e strutture geometriche correlate\u201d","Base Research Fund 2015"],"id":[{"id":"10.13039\/501100010607","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010607","name":"University of Perugia","doi-asserted-by":"crossref","award":["Projects \u201dConfigurazioni Geometriche e Superfici Altamente Simmetriche\u201d and \u201dCodici lineari e strutture geometriche correlate\u201d","Base Research Fund 2015"],"id":[{"id":"10.13039\/501100010607","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010607","name":"University of Perugia","doi-asserted-by":"crossref","award":["Projects \u201dConfigurazioni Geometriche e Superfici Altamente Simmetriche\u201d and \u201dCodici lineari e strutture geometriche correlate\u201d","Base Research Fund 2015"],"id":[{"id":"10.13039\/501100010607","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010607","name":"University of Perugia","doi-asserted-by":"crossref","award":["Projects \u201dConfigurazioni Geometriche e Superfici Altamente Simmetriche\u201d and \u201dCodici lineari e strutture geometriche correlate\u201d","Base Research Fund 2015"],"id":[{"id":"10.13039\/501100010607","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,9]]},"DOI":"10.1007\/s12095-018-0335-0","type":"journal-article","created":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T05:26:03Z","timestamp":1539321963000},"page":"903-920","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["New bounds for linear codes of covering radii 2 and 3"],"prefix":"10.1007","volume":"11","author":[{"given":"Daniele","family":"Bartoli","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5827-4560","authenticated-orcid":false,"given":"Alexander A.","family":"Davydov","sequence":"additional","affiliation":[]},{"given":"Massimo","family":"Giulietti","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Marcugini","sequence":"additional","affiliation":[]},{"given":"Fernanda","family":"Pambianco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,12]]},"reference":[{"key":"335_CR1","unstructured":"Bartoli, D., Davydov, A.A., Faina, G., Kreshchuk, A.A., Marcugini, S., Pambianco, F.: Tables, bounds and graphics of the smallest known sizes of complete arcs in the plane PG(2, q) for all q \u2264\u2009160001 and sporadic q in the interval [160801\u2026430007]. arXiv: 1312.2155v3 (2015)"},{"key":"335_CR2","unstructured":"Bartoli, D., Davydov, A.A., Faina, G., Kreshchuk, A.A., Marcugini, S., Pambianco, F.: Tables, bounds and graphics of sizes of complete lexiarcs in the plane PG(2, q) for all q \u2264\u2009301813 and sporadic q in the interval [301897\u2026430007] obtained by an algorithm with fixed order of points (FOP). arXiv: 1404.0469v2 (2015)"},{"issue":"1","key":"335_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s00022-015-0277-z","volume":"107","author":"D Bartoli","year":"2016","unstructured":"Bartoli, D., Davydov, A.A., Faina, G., Kreshchuk, A.A., Marcugini, S., Pambianco, F.: Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search. J. Geometry 107(1), 89\u2013117 (2016)","journal-title":"J. Geometry"},{"key":"335_CR4","unstructured":"Bartoli, D., Davydov, A.A., Faina, G., Kreshchuk, A.A., Marcugini, S., Pambianco, F.: Tables, bounds and graphics of sizes of complete arcs in the plane PG(2, q) for all q \u2264\u2009321007 and sporadic q in [323761\u2026430007] obtained by an algorithm with fixed order of points (FOP). arXiv: 1404.0469v3 (2018)"},{"key":"335_CR5","doi-asserted-by":"crossref","unstructured":"Bartoli, D., Davydov, A.A., Giulietti, M., Marcugini, S., Pambianco, F.: On upper bounds on the smallest size of a saturating set in a projective plane. arXiv: 1505.01426 (2015)","DOI":"10.1109\/RED.2016.7779320"},{"key":"335_CR6","doi-asserted-by":"crossref","unstructured":"Bartoli, D., Davydov, A.A., Giulietti, M., Marcugini, S., Pambianco, F.: New Upper Bounds on the Smallest Size of a Saturating Set in a Projective Plane. In: 2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY). pp. 18\u201322. IEEE, St. Petersburg, Russia, Sept. 2016. http:\/\/ieeexplore.ieee.org\/document\/7779320 . Accessed 22 August 2018 (2016)","DOI":"10.1109\/RED.2016.7779320"},{"key":"335_CR7","doi-asserted-by":"crossref","unstructured":"Bartoli, D., Davydov, A.A., Giulietti, M., Marcugini, S., Pambianco, F.: New Bounds for Linear Codes of Covering Radius 2. In: Barbero, \u00c1.I., Skachek, V., Ytrehus, \u00d8. (eds.) Proceedings 5Th International Castle Meeting, ICMCTA 2017, Coding Theory and Applications, Vihula, Estonia, Aug. 2017, pp. 1\u201310, Lecture Notes in Computer Science, Vol. 10495. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-66278-7_1"},{"key":"335_CR8","doi-asserted-by":"crossref","unstructured":"Bartoli, D., Davydov, A.A., Marcugini, S., Pambianco, F.: Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5. arXiv: 1712.07078v3 (2018)","DOI":"10.1007\/s12095-018-0335-0"},{"issue":"3\u20134","key":"335_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"335_CR10","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/0097-3165(93)90085-M","volume":"64","author":"RA Brualdi","year":"1998","unstructured":"Brualdi, R.A., Pless, V.S.: Greedy codes. J. Combin. Theory, Ser. A 64(1), 10\u201330 (1998)","journal-title":"J. Combin. Theory, Ser. A"},{"key":"335_CR11","unstructured":"Brualdi, R.A., Litsyn, S., Pless, V.S.: Covering Radius. In: Pless, V. S., Huffman, W. C., Brualdi, R. (eds.) Handbook of Coding Theory, Vol. 1, pp. 755-826. Elsevier, Amsterdam (1998)"},{"key":"335_CR12","volume-title":"Covering codes","author":"G Cohen","year":"1997","unstructured":"Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering codes. Elsevier, Amsterdam (1997)"},{"issue":"5","key":"335_CR13","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1109\/18.771244","volume":"45","author":"AA Davydov","year":"1999","unstructured":"Davydov, A.A.: Constructions and families of nonbinary linear codes with covering radius 2. IEEE Trans. Inform. Theory 45(5), 1679\u20131686 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"335_CR14","unstructured":"Davydov, A.A., Giulietti, M., Marcugini, S., Pambianco, F.: Linear Covering Codes over Nonbinary Finite Fields. In: Proceedings XI International workshop on algebraic and combintorial coding theory, ACCT2008. Pp. 70\u201375. Pamporovo, Bulgaria, June 2008. http:\/\/www.moi.math.bas.bg\/acct2008\/b12.pdf . Accessed 22 August 2018 (2008)"},{"key":"335_CR15","unstructured":"Davydov, A.A., Giulietti, M., Marcugini, S., Pambianco, F.: Linear Covering Codes of Radius 2 and 3. In: Procedings workshop coding theory days in St. Petersburg, pp. 12\u201317. St. PeterSburg, Russia http:\/\/iitp.ru\/upload\/publications\/1538\/CoverPeter2008.pdf . Accessed 22 August 2018 (2008)"},{"issue":"1","key":"335_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.3934\/amc.2011.5.119","volume":"5","author":"AA Davydov","year":"2011","unstructured":"Davydov, A.A., Giulietti, M., Marcugini, S., Pambianco, F.: Linear nonbinary covering codes and saturating sets in projective spaces. Adv. Math. Commun. 5(1), 119\u2013147 (2011)","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"335_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0097-3165(03)00052-9","volume":"103","author":"AA Davydov","year":"2003","unstructured":"Davydov, A.A., Marcugini, S., Pambianco, F.: On saturating sets in projective spaces. J. Combin. Theory, Ser. A 103(1), 1\u201315 (2003)","journal-title":"J. Combin. Theory, Ser. A"},{"issue":"1","key":"335_CR18","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1109\/18.904551","volume":"47","author":"AA Davydov","year":"2001","unstructured":"Davydov, A.A., \u00d6Sterg\u00e5rd, P.R.J.: Linear codes with covering radius R =\u20092, 3 and codimension t R. IEEE Trans. Inform. Theory 47(1), 416\u2013421 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"335_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10623-009-9322-y","volume":"54","author":"AA Davydov","year":"2010","unstructured":"Davydov, A.A., \u00d6Sterg\u00e5rd, P.R.J.: Linear codes with covering radius 3. Des. Codes Cryptogr. 54(3), 253\u2013271 (2010)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"335_CR20","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10623-015-0156-5","volume":"78","author":"T Etzion","year":"2016","unstructured":"Etzion, T., Storme, L.: Galois geometries and coding theory. Des. Codes Cryptogr. 78(1), 311\u2013350 (2016)","journal-title":"Des. Codes Cryptogr."},{"key":"335_CR21","doi-asserted-by":"crossref","unstructured":"Giulietti, M.: The geometry of covering codes: small complete caps and saturating sets in galois spaces. In: Blackburn, S.R., Holloway, R., Wildon, M. (eds.) Surveys in Combinatorics 2013, London Math. Soc. Lecture Note Series, Vol. 409, pp. 51-90. Cambridge University Press, Cambridge (2013)","DOI":"10.1017\/CBO9781139506748.003"},{"key":"335_CR22","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502951.001.0001","volume-title":"Projective geometries over finite fields. Oxford mathematical monographs","author":"JWP Hirschfeld","year":"1998","unstructured":"Hirschfeld, J.W.P.: Projective geometries over finite fields. Oxford mathematical monographs, 2nd. Clarendon Press, Oxford (1998)","edition":"2nd"},{"issue":"1","key":"335_CR23","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0378-3758(98)00043-3","volume":"72","author":"JWP Hirschfeld","year":"1998","unstructured":"Hirschfeld, J.W.P., Storme, L.: The packing problem in statistics, coding theory and finite projective spaces. J Statist Plann Inference 72(1), 355\u2013380 (1998)","journal-title":"J Statist Plann Inference"},{"key":"335_CR24","doi-asserted-by":"crossref","unstructured":"Hirschfeld, J.W.P., Storme, L.: The Packing Problem in Statistics, Coding Theory and Finite Geometry: Update 2001. In: Blokhuis, A., Hirschfeld, J.W.P. (eds.) Proceedings of the 4th isle of thorns conference finite geometries, developments of mathematics, Vol. 3, Chelwood Gate, 2000, pp. 201\u2013246. Kluwer Academic Publisher, Boston (2001)","DOI":"10.1007\/978-1-4613-0283-4_13"},{"key":"335_CR25","unstructured":"Klein, A., Storme, L.: Applications of finite geometry in coding theory and cryptography. In: Crnkovi\u0107, D., Tonchev, V. (eds.) NATO science for peace and security, Ser. - D: information and communication security, vol. 29, information security, coding theory and related combinatorics, pp. 38\u201358 (2011)"},{"issue":"3","key":"335_CR26","first-page":"77","volume":"54","author":"G Kiss","year":"2009","unstructured":"Kiss, G., K\u00f3vacs, I., Kutnar, K., Ruff, J., \u0160parl, P.: A note on a geometric construction of large Cayley graphs of given degree and diameter. Studia Univ. Babes-Bolyai Mathematica 54(3), 77\u201384 (2009)","journal-title":"Studia Univ. Babes-Bolyai Mathematica"},{"key":"335_CR27","unstructured":"Landjev, I., Storme, L.: Galois geometry and coding theory. In: De Beule, J., Storme, L. (eds.) Current Research Topics in Galois Geometry, Chapter 8, pp. 187-214. NOVA Academic Publisher, New York (2012)"},{"key":"335_CR28","unstructured":"Lobstein, A.: Covering radius, an online bibliography https:\/\/www.lri.fr\/lobstein\/bib-a-jour.pdf . Accessed 22 August 2018 (2018)"},{"key":"335_CR29","unstructured":"Monroe, L., Pless, V.: Greedy Generation of Non-Binary Codes. In: Proceedings IEEE international symposium inform. Theory, ISIT 1995, p. 235, Whistler, BC, Canada, Sept. 1995 (1995)"},{"issue":"4","key":"335_CR30","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1016\/j.disc.2018.01.011","volume":"341","author":"ZL Nagy","year":"2018","unstructured":"Nagy, Z.L.: Saturating sets in projective planes and hypergraph covers. Discrete Math. 341(4), 1078\u20131083 (2018)","journal-title":"Discrete Math."},{"key":"335_CR31","unstructured":"Pless, V.S.: Coding Constructions. In: Pless, V.S., Human, W.C., Brualdi, R. (eds.) Handbook of coding theory, pp 141\u2013176. Elsevier, Amsterdam (1998)"},{"issue":"3","key":"335_CR32","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0195-6698(87)80039-2","volume":"8","author":"E Ughi","year":"1987","unstructured":"Ughi, E.: Saturated configurations of points in projective Galois spaces. Europ. J. Combin. 8(3), 325\u2013334 (1987)","journal-title":"Europ. J. Combin."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0335-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-018-0335-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0335-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T08:08:35Z","timestamp":1720685315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-018-0335-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,12]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["335"],"URL":"https:\/\/doi.org\/10.1007\/s12095-018-0335-0","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,12]]},"assertion":[{"value":"30 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2FS12095-018-0335-0', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid123' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:123', '*');; return false;" style='text-decoration: none; '>INTERN </a> <a style='color: white;' href='#diffid123'><sup>4</sup></a></div><div><a href='#diffid878' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:878', '*');; return false;" style='text-decoration: none; '>Note </a> <a style='color: white;' href='#diffid878'><sup>3</sup></a></div><div><a href='#diffid115' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:115', '*');; return false;" style='text-decoration: none; '>Project </a> <a style='color: white;' href='#diffid115'><sup>19</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>