{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:10:22Z","timestamp":1757617822595,"version":"3.44.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T00:00:00Z","timestamp":1743811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T00:00:00Z","timestamp":1743811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NSF","award":["2338424","2244488","2244488"],"award-info":[{"award-number":["2338424","2244488","2244488"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10623-025-01624-w","type":"journal-article","created":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T23:24:25Z","timestamp":1743895465000},"page":"2931-2945","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constructions of locally recoverable codes with large availability"],"prefix":"10.1007","volume":"93","author":[{"given":"Giacomo","family":"Micheli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Pallozzi Lavorante","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhi","family":"Shukul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noah","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,5]]},"reference":[{"issue":"10","key":"1624_CR1","doi-asserted-by":"publisher","first-page":"6056","DOI":"10.1109\/TIT.2019.2919830","volume":"65","author":"S Ballentine","year":"2019","unstructured":"Ballentine S., Barg A., Vl\u0103du\u0163 S.: Codes with hierarchical locality from covering maps of curves. IEEE Trans. Inf. Theory 65(10), 6056\u20136071 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1624_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-63931-4_4","volume-title":"Algebraic Geometry for Coding Theory and Cryptography","author":"A Barg","year":"2017","unstructured":"Barg A., Haymaker K., Howe E.W., Matthews G.L., V\u00e1rilly-Alvarado A.: Locally recoverable codes from algebraic curves and surfaces. In: Algebraic Geometry for Coding Theory and Cryptography, pp. 95\u2013127. Springer, Cham (2017)."},{"key":"1624_CR3","first-page":"1252","volume-title":"Information Theory (ISIT), 2015 IEEE International Symposium","author":"A Barg","year":"2015","unstructured":"Barg A., Tamo I., Vl\u0103du\u0163 S.: Locally recoverable codes on algebraic curves. In: Information Theory (ISIT), 2015 IEEE International Symposium, pp. 1252\u20131256. IEEE, Piscataway (2015)."},{"issue":"11","key":"1624_CR4","doi-asserted-by":"publisher","first-page":"6799","DOI":"10.1109\/TIT.2020.2995852","volume":"66","author":"D Bartoli","year":"2020","unstructured":"Bartoli D., Montanucci M., Quoos L.: Locally recoverable codes from automorphism group of function fields of genus $$g>1$$. IEEE Trans. Inf. Theory 66(11), 6799\u20136808 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1624_CR5","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.jalgebra.2023.09.027","volume":"638","author":"L Bastioni","year":"2024","unstructured":"Bastioni L., Micheli G.: On complete m-arcs. J. Algebra 638, 238\u2013254 (2024).","journal-title":"J. Algebra"},{"key":"1624_CR6","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1109\/ISIT50566.2022.9834902","volume-title":"2022 IEEE International Symposium on Information Theory (ISIT)","author":"A Beemer","year":"2022","unstructured":"Beemer A., Kshirsagar R., Matthews G.L.: Graph-based codes for hierarchical recovery. In: 2022 IEEE International Symposium on Information Theory (ISIT), pp. 1554\u20131559. IEEE, Piscataway (2022)."},{"issue":"11","key":"1624_CR7","doi-asserted-by":"publisher","first-page":"5787","DOI":"10.1109\/TIT.2015.2477406","volume":"61","author":"VR Cadambe","year":"2015","unstructured":"Cadambe V.R., Mazumdar A.: Bounds on the size of locally recoverable codes. IEEE Trans. Inf. Theory 61(11), 5787\u20135794 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1624_CR8","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"AG Dimakis","year":"2010","unstructured":"Dimakis A.G., Godfrey P.B., Wu Y., Wainwright M.J., Ramchandran K.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory 56(9), 4539\u20134551 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1624_CR9","doi-asserted-by":"publisher","first-page":"6981","DOI":"10.1109\/TIT.2023.3298401","volume":"69","author":"A Dukes","year":"2023","unstructured":"Dukes A., Micheli G., Lavorante V.P.: Optimal locally recoverable codes with hierarchy from nested f-adic expansions. IEEE Trans. Inf. Theory 69(11), 6981\u20136988 (2023).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1624_CR10","unstructured":"Freij-Hollanti R., Westerb\u00e4ck T., Hollanti C.: Locally repairable codes with availability and hierarchy: matroid theory via examples. In: International Zurich Seminar on Communications-Proceedings, pp. 45\u201349. ETH Zurich (2016)."},{"key":"1624_CR11","doi-asserted-by":"crossref","unstructured":"Garrison C., Micheli G., Nott L., Lavorante V.P., Waitkevich P.: On a class of optimal locally recoverable codes with availability. In: 2023 IEEE International Symposium on Information Theory (ISIT), pp. 2021\u20132026 (2023).","DOI":"10.1109\/ISIT54713.2023.10206840"},{"issue":"2","key":"1624_CR12","doi-asserted-by":"publisher","first-page":"317","DOI":"10.3934\/amc.2018020","volume":"12","author":"K Haymaker","year":"2018","unstructured":"Haymaker K., Malmskog B., Matthews G.L.: Locally recoverable codes with availability $$t\\ge 2$$ from fiber products of curves. Adv. Math. Commun. 12(2), 317 (2018).","journal-title":"Adv. Math. Commun."},{"issue":"8","key":"1624_CR13","doi-asserted-by":"publisher","first-page":"1673","DOI":"10.1007\/s10623-020-00726-x","volume":"88","author":"HH L\u00f3pez","year":"2020","unstructured":"L\u00f3pez H.H., Matthews G.L., Soprunov I.: Monomial-cartesian codes and their duals, with applications to lcd codes, quantum codes, and locally recoverable codes. Des. Codes Cryptogr. 88(8), 1673\u20131685 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"1624_CR14","first-page":"1","volume":"09","author":"G Micheli","year":"2019","unstructured":"Micheli G.: Constructions of locally recoverable codes which are optimal. IEEE Trans. Inf. Theory 09, 1\u20131 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1624_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-76878-4","volume-title":"Algebraic Function Fields and Codes","author":"H Stichtenoth","year":"2009","unstructured":"Stichtenoth H.: Algebraic Function Fields and Codes, vol. 254. Springer, Berlin (2009)."},{"issue":"8","key":"1624_CR16","doi-asserted-by":"publisher","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","volume":"60","author":"I Tamo","year":"2014","unstructured":"Tamo I., Barg A.: A family of optimal locally recoverable codes. IEEE Trans. Inf. Theory 60(8), 4661\u20134676 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1624_CR17","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1017\/S1446788700038349","volume":"58","author":"G Turnwald","year":"1995","unstructured":"Turnwald G.: On Schur\u2019s conjecture. J. Aust. Math. Soc. Ser. A 58(3), 312\u2013357 (1995).","journal-title":"J. Aust. Math. Soc. Ser. A"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01624-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01624-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01624-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T10:13:21Z","timestamp":1757153601000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01624-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,5]]},"references-count":17,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["1624"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01624-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,4,5]]},"assertion":[{"value":"12 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}