{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:04:25Z","timestamp":1757617465381,"version":"3.44.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T00:00:00Z","timestamp":1740355200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T00:00:00Z","timestamp":1740355200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-21- CE39-0009-BARRACUDA"],"award-info":[{"award-number":["ANR-21- CE39-0009-BARRACUDA"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10623-025-01597-w","type":"journal-article","created":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T07:34:58Z","timestamp":1740382498000},"page":"2317-2332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Introducing locality in some generalized AG codes"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5412-6379","authenticated-orcid":false,"given":"Bastien","family":"Pacifico","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,24]]},"reference":[{"issue":"10","key":"1597_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":"1597_CR2","doi-asserted-by":"crossref","unstructured":"Ballet S., Rolland R.: Families of curves over any finite field attaining the generalized Drinfeld-Vl\u0103du\u0163 bound. Publ. math. Besan\u00e7on. 5\u201318 (2011).","DOI":"10.5802\/pmb.a-132"},{"issue":"457","key":"1597_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.4213\/rm9928","volume":"76:1","author":"S Ballet","year":"2021","unstructured":"Ballet S., Chaumine J., Pieltant J., Rambaud M., Randriambololona H., Rolland R.: On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry. Uspekhi Mathematichskikh Nauk 76:1(457), 31\u201394 (2021).","journal-title":"Uspekhi Mathematichskikh Nauk"},{"key":"1597_CR4","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: Howe E.W., Lauter K.E., Walker J.L. (eds.) Algebraic Geometry for Coding Theory and Cryptography, pp. 95\u2013127. Springer, Cham (2017)."},{"issue":"8","key":"1597_CR5","doi-asserted-by":"publisher","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","volume":"60","author":"A Barg","year":"2014","unstructured":"Barg A., Tamo I.: A family of optimal locally recoverable codes. IEEE Trans. Inf. Theory 60(8), 4661\u20134676 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1597_CR6","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"},{"key":"1597_CR7","doi-asserted-by":"crossref","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997). Computational algebra and number theory (London, 1993).","DOI":"10.1006\/jsco.1996.0125"},{"issue":"11","key":"1597_CR8","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":"7","key":"1597_CR9","doi-asserted-by":"publisher","first-page":"4930","DOI":"10.1109\/TIT.2011.2180696","volume":"58","author":"I Cascudo","year":"2012","unstructured":"Cascudo I., Cramer R., Xing C., Yang A.: Asymptotic bound for multiplication complexity in the extensions of small finite fields. IEEE Trans. Inf. Theory 58(7), 4930\u20134935 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1597_CR10","doi-asserted-by":"publisher","first-page":"2786","DOI":"10.1109\/TIT.2021.3052749","volume":"67","author":"H Chen","year":"2021","unstructured":"Chen H., Weng J., Luo W., Liqing X.: Long optimal and small-defect lrc codes with unbounded minimum distances. IEEE Trans. Inf. Theory 67(5), 2786\u20132792 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"1597_CR11","doi-asserted-by":"publisher","first-page":"5623","DOI":"10.1109\/TCOMM.2023.3292293","volume":"71","author":"JY Chen","year":"2023","unstructured":"Chen J.Y., Liu S., Ma L., Ting-Yi W., Xing C.: Optimal and asymptotically good locally repairable codes via propagation rules. IEEE Trans. Commun. 71(10), 5623\u20135632 (2023).","journal-title":"IEEE Trans. Commun."},{"key":"1597_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0885-064X(88)90012-X","volume":"4","author":"D Chudnovsky","year":"1988","unstructured":"Chudnovsky D., Chudnovsky G.: Algebraic complexities and algebraic curves over finite fields. J. Complex. 4, 285\u2013316 (1988).","journal-title":"J. Complex."},{"key":"1597_CR13","unstructured":"Forney G.D.: Concatenated Codes. M.I.T. Press research monographs. M.I.T Press (1966)."},{"key":"1597_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01884295","volume":"121","author":"A Garcia","year":"1995","unstructured":"Garcia A., Stichtenoth H.: A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vl\u0103du\u0163 bound. Inventiones Mathematicae 121, 211\u2013222 (1995).","journal-title":"Inventiones Mathematicae"},{"issue":"11","key":"1597_CR15","doi-asserted-by":"publisher","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","volume":"58","author":"P Gopalan","year":"2012","unstructured":"Gopalan P., Huang C., Simitci H., Yekhanin S.: On the locality of codeword symbols. IEEE Trans. Inf. Theory 58(11), 6925\u20136934 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1597_CR16","first-page":"1289","volume":"259","author":"VD Goppa","year":"1981","unstructured":"Goppa V.D.: Codes on algebraic curves. Dokl. Akad. Nauk SSSR 259(6), 1289\u20131290 (1981).","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"6","key":"1597_CR17","doi-asserted-by":"publisher","first-page":"3662","DOI":"10.1109\/TIT.2019.2891765","volume":"65","author":"V Guruswami","year":"2019","unstructured":"Guruswami V., Xing C., Yuan C.: How long can optimal locally repairable codes be? IEEE Trans. Inf. Theory 65(6), 3662\u20133670 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1597_CR18","doi-asserted-by":"crossref","unstructured":"Huang C., Chen M., Li J.: Pyramid codes: flexible schemes to trade space for access efficiency in reliable data storage systems. In: Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), pp. 79\u201386. (2007).","DOI":"10.1109\/NCA.2007.37"},{"issue":"8","key":"1597_CR19","doi-asserted-by":"publisher","first-page":"4987","DOI":"10.1109\/TCOMM.2021.3083320","volume":"69","author":"G Luo","year":"2021","unstructured":"Luo G., Cao X.: Constructions of optimal binary locally recoverable codes via a general construction of linear codes. IEEE Trans. Commun. 69(8), 4987\u20134997 (2021).","journal-title":"IEEE Trans. Commun."},{"issue":"9","key":"1597_CR20","doi-asserted-by":"publisher","first-page":"5395","DOI":"10.1109\/TIT.2020.2970419","volume":"66","author":"L Ma","year":"2020","unstructured":"Ma L., Xing C.: Constructive asymptotic bounds of locally repairable codes via function fields. IEEE Trans. Inf. Theory 66(9), 5395\u20135403 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1597_CR21","doi-asserted-by":"publisher","first-page":"5765","DOI":"10.1109\/TIT.2021.3090939","volume":"67","author":"C Salgado","year":"2021","unstructured":"Salgado C., V\u00e1rilly-Alvarado A., Voloch J.F.: Locally recoverable codes on surfaces. IEEE Trans. Inf. Theory 67(9), 5765\u20135777 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1597_CR22","doi-asserted-by":"crossref","unstructured":"Shparlinski I., Tsfasman M., Vl\u0103du\u0163 S.: Curves with many points and multiplication in finite fields. In: Stichtenoth H., Tsfasman M.A. (eds.) Coding Theory and Algebraic Geometry, number 1518 in Lectures Notes in Mathematics, pp. 145\u2013169. Springer, Berlin (1992). Proceedings of AGCT-3 conference, June 17\u201321, 1991, Luminy.","DOI":"10.1007\/BFb0087999"},{"key":"1597_CR23","doi-asserted-by":"crossref","unstructured":"Silberstein N., Rawat A.S., Koyluoglu O.O., Sriram V.: Optimal locally repairable codes via rank-metric codes. In: 2013 IEEE International Symposium on Information Theory, pp. 1819\u20131823. (2013).","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"1597_CR24","series-title":"Number 254 in Graduate Texts in Mathematics","volume-title":"Algebraic Function Fields and Codes","author":"H Stichtenoth","year":"2008","unstructured":"Stichtenoth H.: Algebraic Function Fields and Codes, 2nd edn Number 254 in Graduate Texts in Mathematics. Springer, Berlin (2008).","edition":"2"},{"issue":"6","key":"1597_CR25","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":"1597_CR26","doi-asserted-by":"crossref","unstructured":"Tamo I., Papailiopoulos D.S., Dimakis A.G.: Optimal locally repairable codes and connections to matroid theory. In: 2013 IEEE International Symposium on Information Theory, pp. 1814\u20131818. (2013).","DOI":"10.1109\/ISIT.2013.6620540"},{"issue":"1","key":"1597_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10623-022-01099-z","volume":"91","author":"P Tan","year":"2023","unstructured":"Tan P., Fan C., Ding C., Tang C., Zhou Z.: The minimum locality of linear codes. Des. Codes Cryptogr. 91(1), 83\u2013114 (2023).","journal-title":"Des. Codes Cryptogr."},{"issue":"7","key":"1597_CR28","doi-asserted-by":"publisher","first-page":"2498","DOI":"10.1109\/18.796390","volume":"45","author":"C Xing","year":"1999","unstructured":"Xing C., Niederreiter H., Lam K.-Y.: A generalization of algebraic-geometry codes. IEEE Trans. Inf. Theory 45(7), 2498\u20132501 (1999).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01597-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01597-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-01597-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T06:36:08Z","timestamp":1757140568000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01597-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,24]]},"references-count":28,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["1597"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01597-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,2,24]]},"assertion":[{"value":"29 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}