{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T22:17:57Z","timestamp":1777587477377,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T00:00:00Z","timestamp":1677888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T00:00:00Z","timestamp":1677888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Science Foundation","award":["2137661"],"award-info":[{"award-number":["2137661"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10623-023-01189-6","type":"journal-article","created":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T12:02:47Z","timestamp":1677931367000},"page":"2077-2105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves"],"prefix":"10.1007","volume":"91","author":[{"given":"Mar\u00eda","family":"Chara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sam","family":"Kottler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4878-9939","authenticated-orcid":false,"given":"Beth","family":"Malmskog","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bianca","family":"Thompson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mckenzie","family":"West","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,4]]},"reference":[{"issue":"10","key":"1189_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-018-9482-6","volume":"61","author":"SB Balaji","year":"2018","unstructured":"Balaji S.B., Nikhil Krishnan M., Vajha M., Ramkumar V., Sasidharan B., Vijay Kumar P.: Erasure coding for distributed storage: an overview. Sci. China Inf. Sci. 61(10), 1\u201345 (2018).","journal-title":"Sci. China Inf. Sci."},{"issue":"8","key":"1189_CR2","doi-asserted-by":"publisher","first-page":"4928","DOI":"10.1109\/TIT.2017.2700859","volume":"63","author":"A Barg","year":"2017","unstructured":"Barg A., Tamo I., Vl\u0103du\u0163 S.: Locally recoverable codes on algebraic curves. IEEE Trans. Inf. Theory 63(8), 4928\u20134939 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1189_CR3","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\\ge 1$$. IEEE Trans. Inf. Theory 66(11), 6799\u20136808 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1189_CR4","doi-asserted-by":"crossref","unstructured":"Bhadane S., Thangaraj A.: Unequal locality and recovery for locally recoverable codes with availability. In: 2017 Twenty-Third National Conference on Communications (NCC), pp.\u00a01\u20136 (2017).","DOI":"10.1109\/NCC.2017.8077091"},{"issue":"2","key":"1189_CR5","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."},{"key":"1189_CR6","doi-asserted-by":"crossref","unstructured":"Kadhe S., Calderbank R.: Rate optimal binary linear locally repairable codes with small availability. In: 2017 IEEE International Symposium on Information Theory (ISIT), pp. 166\u2013170 (2017).","DOI":"10.1109\/ISIT.2017.8006511"},{"key":"1189_CR7","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.ffa.2018.07.005","volume":"54","author":"C Munuera","year":"2018","unstructured":"Munuera C., Ten\u00f3rio W.: Locally recoverable codes from rational maps. Finite Fields Appl. 54, 80\u2013100 (2018).","journal-title":"Finite Fields Appl."},{"issue":"2","key":"1189_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.3934\/amc.2020019","volume":"14","author":"C Munuera","year":"2020","unstructured":"Munuera C., Ten\u00f3rio W., Torres F.: Locally recoverable codes from algebraic curves with separated variables. Adv. Math. Commun. 14(2), 265\u2013278 (2020).","journal-title":"Adv. Math. Commun."},{"key":"1189_CR9","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, New York (2009)."},{"key":"1189_CR10","doi-asserted-by":"crossref","unstructured":"Tamo I., Barg A.: Bounds on locally recoverable codes with multiple recovering sets. In: 2014 IEEE International Symposium on Information Theory, pp. 691\u2013695 (2014).","DOI":"10.1109\/ISIT.2014.6874921"},{"issue":"8","key":"1189_CR11","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":"6","key":"1189_CR12","doi-asserted-by":"publisher","first-page":"3070","DOI":"10.1109\/TIT.2016.2518663","volume":"62","author":"I Tamo","year":"2016","unstructured":"Tamo I., Barg A., Frolov A.: Bounds on the parameters of locally recoverable codes. IEEE Trans. Inf. Theory 62(6), 3070\u20133083 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1189_CR13","unstructured":"van\u00a0der Geer G., van\u00a0der Vlugt M.: How to construct curves over finite fields with many points. In: Arithmetic Geometry, Symposia Mathematica XXXVII, pp. 169\u2013189. Cambridge University Press, Cambridge (1997)."},{"key":"1189_CR14","doi-asserted-by":"crossref","unstructured":"Vardy A.: Algorithmic complexity in coding theory and the minimum distance problem. In STOC \u201997, (1997).","DOI":"10.1145\/258533.258559"},{"key":"1189_CR15","doi-asserted-by":"crossref","unstructured":"Wang A., Zhang Z., Liu M.: Achieving arbitrary locality and availability in binary codes. In: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 1866\u20131870 (2015).","DOI":"10.1109\/ISIT.2015.7282779"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01189-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01189-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01189-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T20:09:26Z","timestamp":1682021366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01189-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,4]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1189"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01189-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,4]]},"assertion":[{"value":"25 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2023","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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}