{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:34Z","timestamp":1740122554825,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T00:00:00Z","timestamp":1714176000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T00:00:00Z","timestamp":1714176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"GNSAGA - INDAM","award":["U-UFMBAZ-2019-000160, 11.02.2019"],"award-info":[{"award-number":["U-UFMBAZ-2019-000160, 11.02.2019"]}]},{"DOI":"10.13039\/501100010607","name":"University of Perugia","doi-asserted-by":"crossref","award":["Project No. 98751"],"award-info":[{"award-number":["Project No. 98751"]}],"id":[{"id":"10.13039\/501100010607","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10623-024-01402-0","type":"journal-article","created":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T14:02:03Z","timestamp":1714226523000},"page":"2527-2548","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Further results on covering codes with radius R and codimension $$tR+1$$"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5827-4560","authenticated-orcid":false,"given":"Alexander A.","family":"Davydov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7961-0260","authenticated-orcid":false,"given":"Stefano","family":"Marcugini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5476-5365","authenticated-orcid":false,"given":"Fernanda","family":"Pambianco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,27]]},"reference":[{"issue":"2","key":"1402_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00200-008-0058-0","volume":"19","author":"TL Alderson","year":"2008","unstructured":"Alderson T.L., Bruen A.A.: Maximal AMDS codes. Appl. Algebra Eng. Commun. Comput. 19(2), 87\u201398 (2008). https:\/\/doi.org\/10.1007\/s00200-008-0058-0.","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"5","key":"1402_CR2","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1007\/s12095-018-0335-0","volume":"11","author":"D Bartoli","year":"2019","unstructured":"Bartoli D., Davydov A.A., Giulietti M., Marcugini S., Pambianco F.: New bounds for linear codes of covering radii 2 and 3. Crypt. Commun. 11(5), 903\u2013920 (2019). https:\/\/doi.org\/10.1007\/s12095-018-0335-0.","journal-title":"Crypt. Commun."},{"key":"1402_CR3","volume-title":"Introduction to Coding Theory","author":"J Bierbrauer","year":"2017","unstructured":"Bierbrauer J.: Introduction to Coding Theory, 2nd edn Chapman and Hall\/CRC Press, Boca Raton (2017).","edition":"2"},{"issue":"1","key":"1402_CR4","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/S0021-9800(66)80007-8","volume":"1","author":"RC Bose","year":"1966","unstructured":"Bose R.C., Burton R.C.: A characterization of flat spaces in a finite geometry and the uniqueness of the Hamming and McDonald codes. J. Comb. Theory 1(1), 96\u2013104 (1966). https:\/\/doi.org\/10.1016\/S0021-9800(66)80007-8.","journal-title":"J. Comb. Theory"},{"key":"1402_CR5","first-page":"755","volume-title":"Handbook of Coding Theory","author":"RA Brualdi","year":"1998","unstructured":"Brualdi R.A., Litsyn S., Pless V.: Covering radius. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, vol. 1, pp. 755\u2013826. Elsevier, Amsterdam (1998)."},{"key":"1402_CR6","doi-asserted-by":"publisher","unstructured":"Chen H., Qu L., Li C., Lyu S., Xu L.: Generalized Singleton type upper bounds, arXiv:2208.01138 (2020). https:\/\/doi.org\/10.48550\/arXiv.2208.01138.","DOI":"10.48550\/arXiv.2208.01138"},{"key":"1402_CR7","volume-title":"Covering Codes. North-Holland Math. Library","author":"G Cohen","year":"1997","unstructured":"Cohen G., Honkala I., Litsyn S., Lobstein A.: Covering Codes. North-Holland Math. Library, vol. 54. Elsevier, Amsterdam (1997)."},{"issue":"4","key":"1402_CR8","first-page":"317","volume":"26","author":"AA Davydov","year":"1990","unstructured":"Davydov A.A.: Construction of linear covering codes. Probl. Inf. Transmiss. 26(4), 317\u2013331 (1990).","journal-title":"Probl. Inf. Transmiss."},{"issue":"1","key":"1402_CR9","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). https:\/\/doi.org\/10.3934\/amc.2011.5.119.","journal-title":"Adv. Math. Commun."},{"issue":"12","key":"1402_CR10","doi-asserted-by":"publisher","first-page":"2771","DOI":"10.1007\/s10623-019-00649-2","volume":"87","author":"AA Davydov","year":"2019","unstructured":"Davydov A.A., Marcugini S., Pambianco F.: New covering codes of radius $$R$$, codimension $$tR$$ and $$tR+\\frac{R}{2}$$, and saturating sets in projective spaces. Des. Codes Cryptogr. 87(12), 2771\u20132792 (2019). https:\/\/doi.org\/10.1007\/s10623-019-00649-2.","journal-title":"Des. Codes Cryptogr."},{"key":"1402_CR11","doi-asserted-by":"publisher","unstructured":"Davydov A.A., Marcugini S., Pambianco F.: New bounds for linear codes of covering radius 3 and 2-saturating sets in projective spaces. In: Proc. 2019 XVI Int. Symp. Problems Redundancy Inform. Control Systems (REDUNDANCY), Moscow, Russia, Oct. 2019, IEEE Xplore, pp. 47\u201352 (2020). https:\/\/doi.org\/10.1109\/REDUNDANCY48165.2019.9003348.","DOI":"10.1109\/REDUNDANCY48165.2019.9003348"},{"issue":"1","key":"1402_CR12","doi-asserted-by":"publisher","first-page":"98","DOI":"10.3934\/amc.2021074","volume":"17","author":"AA Davydov","year":"2023","unstructured":"Davydov A.A., Marcugini S., Pambianco F.: Upper bounds on the length function for covering codes with covering radius $$R$$ and codimension $$tR+1$$. Adv. Math. Commun. 17(1), 98\u2013118 (2023). https:\/\/doi.org\/10.3934\/amc.2021074.","journal-title":"Adv. Math. Commun."},{"key":"1402_CR13","doi-asserted-by":"publisher","unstructured":"Davydov A.A., Marcugini S., Pambianco F.: New bounds for covering codes of radius 3 and codimension $$3t + 1$$, Adv. Math. Commun. to appear. https:\/\/doi.org\/10.3934\/amc.2023042.","DOI":"10.3934\/amc.2023042"},{"issue":"1","key":"1402_CR14","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=2,3$$ and codimension $$tR$$. IEEE Trans. Inf. Theory 47(1), 416\u2013421 (2001). https:\/\/doi.org\/10.1109\/18.904551.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1402_CR15","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). https:\/\/doi.org\/10.1007\/s10623-009-9322-y.","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1402_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF00124590","volume":"9","author":"MA De Boer","year":"1996","unstructured":"De Boer M.A.: Almost MDS codes. Des. Codes Cryptogr. 9(2), 143\u2013155 (1996). https:\/\/doi.org\/10.1007\/BF00124590.","journal-title":"Des. Codes Cryptogr."},{"issue":"9","key":"1402_CR17","doi-asserted-by":"publisher","first-page":"2113","DOI":"10.1007\/s10623-021-00951-y","volume":"90","author":"L Denaux","year":"2022","unstructured":"Denaux L.: Constructing saturating sets in projective spaces using subgeometries. Des. Codes Cryptogr. 90(9), 2113\u20132144 (2022). https:\/\/doi.org\/10.1007\/s10623-021-00951-y.","journal-title":"Des. Codes Cryptogr."},{"key":"1402_CR18","doi-asserted-by":"publisher","unstructured":"Denaux L.: Higgledy-piggledy sets in projective spaces of small dimension. Electron. J. Comb. 29(3), Article #P3.29 (2022). https:\/\/doi.org\/10.37236\/10736.","DOI":"10.37236\/10736"},{"issue":"1","key":"1402_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01222850","volume":"54","author":"S Dodunekov","year":"1995","unstructured":"Dodunekov S., Landgev I.: On near-MDS codes. J. Geom. 54(1), 30\u201343 (1995). https:\/\/doi.org\/10.1007\/BF01222850.","journal-title":"J. Geom."},{"issue":"1","key":"1402_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). https:\/\/doi.org\/10.1007\/s10623-015-0156-5.","journal-title":"Des. Codes Cryptogr."},{"key":"1402_CR21","doi-asserted-by":"publisher","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, Lecture Note Series 409, pp. 51\u201390. London Math. Soc., Cambridge University Press, Cambridge (2013). https:\/\/doi.org\/10.1017\/CBO9781139506748.003.","DOI":"10.1017\/CBO9781139506748.003"},{"issue":"1","key":"1402_CR22","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/TIT.1985.1057039","volume":"31","author":"RL Graham","year":"1985","unstructured":"Graham R.L., Sloane N.J.A.: On the covering radius of codes. IEEE Trans. Inf. Theory 31(1), 385\u2013401 (1985). https:\/\/doi.org\/10.1109\/TIT.1985.1057039.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1402_CR23","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/TIT.2021.3123730","volume":"68","author":"T H\u00e9ger","year":"2022","unstructured":"H\u00e9ger T., Nagy Z.L.: Short minimal codes and covering codes via strong blocking sets in projective spaces. IEEE Trans. Inf. Theory 68(2), 881\u2013890 (2022). https:\/\/doi.org\/10.1109\/TIT.2021.3123730.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1402_CR24","volume-title":"Projective Geometries Over Finite Fields","author":"JWP Hirschfeld","year":"1999","unstructured":"Hirschfeld J.W.P.: Projective Geometries Over Finite Fields, 2nd edn Oxford Univ. Press, Oxford (1999).","edition":"2"},{"key":"1402_CR25","doi-asserted-by":"publisher","unstructured":"Hirschfeld J.W.P., Storme L.: The packing problem in statistics, coding theory and finite projective spaces: Update 2001. In: Blokhuis A., Hirschfeld J.W.P., Jungnickel D., Thas J.A. (eds.) Finite Geometries (Proc. 4th Isle of Thorns Conf., July 16\u201321, 2000), Develop. Math. 3, pp. 201\u2013246. Kluwer, Dordrecht, (2001). https:\/\/doi.org\/10.1007\/978-1-4613-0283-4_13.","DOI":"10.1007\/978-1-4613-0283-4_13"},{"key":"1402_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.S.: Fundamentals of Error-Correcting Codes. Cambridge Univ Press, Cambridge (2003)."},{"key":"1402_CR27","volume-title":"Handbook of Mathematical Formulas and Integrals","author":"A Jeffrey","year":"2008","unstructured":"Jeffrey A., Dai H.H.: Handbook of Mathematical Formulas and Integrals, 4th edn Elsevier, Academic Press (2008).","edition":"4"},{"key":"1402_CR28","first-page":"187","volume-title":"Current Research Topics in Galois geometry, Chapter 8","author":"I Landjev","year":"2011","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\u2013214. NOVA Academic, New York (2011)."},{"key":"1402_CR29","unstructured":"Lobstein A.: Covering radius, an online bibliography (2023). https:\/\/www.lri.fr\/~lobstein\/bib-a-jour.pdf."},{"key":"1402_CR30","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1981","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes, 3rd edn North-Holland, Amsterdam (1981).","edition":"3"},{"key":"1402_CR31","doi-asserted-by":"publisher","unstructured":"Meneghetti A., Pellegrini M., Sala M.: A formula on the weight distribution of linear codes with applications to AMDS codes. Finite Fields Appl. 77, article 101933 (2022). https:\/\/doi.org\/10.1016\/j.ffa.2021.101933.","DOI":"10.1016\/j.ffa.2021.101933"},{"issue":"4","key":"1402_CR32","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. Discret. Math. 341(4), 1078\u20131083 (2018). https:\/\/doi.org\/10.1016\/j.disc.2018.01.011.","journal-title":"Discret. Math."},{"issue":"1","key":"1402_CR33","doi-asserted-by":"publisher","first-page":"26","DOI":"10.2307\/2308012","volume":"62","author":"H Robbins","year":"1955","unstructured":"Robbins H.: A remark on Stirling\u2019s formula. Am. Math. Monthly 62(1), 26\u201329 (1955). https:\/\/doi.org\/10.2307\/2308012.","journal-title":"Am. Math. Monthly"},{"key":"1402_CR34","doi-asserted-by":"publisher","unstructured":"Struik R.: Covering Codes. Ph.D thesis. Eindhoven University of Technology, The Netherlands, (1994). https:\/\/doi.org\/10.6100\/IR425174.","DOI":"10.6100\/IR425174"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01402-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01402-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01402-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T16:11:50Z","timestamp":1723219910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01402-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,27]]},"references-count":34,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["1402"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01402-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,4,27]]},"assertion":[{"value":"5 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}