{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T07:03:11Z","timestamp":1780038191367,"version":"3.53.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T00:00:00Z","timestamp":1777075200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T00:00:00Z","timestamp":1777075200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["OCENW.KLEIN.53"],"award-info":[{"award-number":["OCENW.KLEIN.53"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008398","name":"Villum Fonden","doi-asserted-by":"publisher","award":["VIL\u201c52303\u201d"],"award-info":[{"award-number":["VIL\u201c52303\u201d"]}],"id":[{"id":"10.13039\/100008398","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":[[2026,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We develop a duality theory of locally recoverable codes (LRCs) and apply it to establish a series of new bounds on their parameters. We introduce and study a refined notion of weight distribution that captures the code\u2019s locality. Using a duality result analogous to a MacWilliams identity, we then derive an LP-type bound that improves on the best known bounds in several instances. Using a dual distance bound and the theory of generalized weights, we obtain non-existence results for optimal LRCs over small fields. In particular, we show that an optimal LRC must have both minimum distance and block length relatively small compared to the field size.<\/jats:p>","DOI":"10.1007\/s10623-026-01829-7","type":"journal-article","created":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T07:42:49Z","timestamp":1777102969000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LRCS: Duality, LP bounds, and field size"],"prefix":"10.1007","volume":"94","author":[{"given":"Anina","family":"Gruica","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Jany","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto","family":"Ravagnani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,25]]},"reference":[{"issue":"5","key":"1829_CR1","doi-asserted-by":"publisher","first-page":"3481","DOI":"10.1109\/TIT.2018.2800042","volume":"64","author":"A Agarwal","year":"2018","unstructured":"Agarwal A., Barg A., Hu S., Mazumdar A., Tamo I.: Combinatorial alphabet-dependent bounds for locally recoverable codes. IEEE Trans. Inf. Theory 64(5), 3481\u20133492 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1829_CR2","volume-title":"Combinatorial Theory","author":"M Aigner","year":"2012","unstructured":"Aigner M.: Combinatorial Theory, vol. 234. Springer, New York (2012)."},{"key":"1829_CR3","doi-asserted-by":"crossref","unstructured":"Barg A., Haymaker K., Howe E., Matthews G., V\u00e1rilly-Alvarado A.: Locally recoverable codes from algebraic curves and surfaces. In: Algebraic Geometry for Coding Theory and Cryptography. IPAM, Los Angeles: Springer 2017, 95\u2013127 (2016).","DOI":"10.1007\/978-3-319-63931-4_4"},{"issue":"8","key":"1829_CR4","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":"1829_CR5","doi-asserted-by":"publisher","first-page":"5787","DOI":"10.1109\/TIT.2015.2477406","volume":"61","author":"V Cadambe","year":"2015","unstructured":"Cadambe V., 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":"8","key":"1829_CR6","doi-asserted-by":"publisher","first-page":"4853","DOI":"10.1109\/TIT.2020.2977647","volume":"66","author":"H Cai","year":"2020","unstructured":"Cai H., Miao Y., Schwartz M., Tang X.: On optimal locally repairable codes with super-linear length. IEEE Trans. Inf. Theory 66(8), 4853\u20134868 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1829_CR7","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/TIT.2020.3037268","volume":"67","author":"H Cai","year":"2020","unstructured":"Cai H., Schwartz M.: On optimal locally repairable codes and generalized sector-disk codes. IEEE Trans. Inf. Theory 67(2), 686\u2013704 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1829_CR8","unstructured":"Delsarte P.: An algebraic approach to the association schemes of coding theory, Philips Res. Rep. Suppl. 10, Vi+\u201397 (1973)."},{"key":"1829_CR9","first-page":"385","volume-title":"Matroid theory and storage codes: bounds and constructions","author":"R Freij-Hollanti","year":"2018","unstructured":"Freij-Hollanti R., Hollanti C., Westerb\u00e4ck T.: Matroid theory and storage codes: bounds and constructions, pp. 385\u2013425. Springer, New York (2018)."},{"key":"1829_CR10","unstructured":"Galindo, C., Hernando, F., Munuera, C., Ruano, D.: Locally recoverable codes from the matrix-product construction. arXiv:2310.15703 (2023)."},{"key":"1829_CR11","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s10623-014-9940-x","volume":"75","author":"H Gluesing-Luerssen","year":"2015","unstructured":"Gluesing-Luerssen H.: Fourier-reflexive partitions and Macwilliams identities for additive codes. Des. Codes Crypt. 75, 543\u2013563 (2015).","journal-title":"Des. Codes Crypt."},{"issue":"11","key":"1829_CR12","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":"10","key":"1829_CR13","doi-asserted-by":"publisher","first-page":"6089","DOI":"10.1109\/TIT.2019.2911595","volume":"65","author":"M Grezet","year":"2019","unstructured":"Grezet M., Freij-Hollanti R., Westerb\u00e4ck T., Hollanti C.: Alphabet-dependent bounds for linear locally repairable codes based on residual codes. IEEE Trans. Inf. Theory 65(10), 6089\u20136100 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1829_CR14","doi-asserted-by":"crossref","unstructured":"Gruica A., Jany B., Ravagnani A.: Duality and LP bounds for codes with locality, 2023 IEEE Information Theory Workshop (ITW). IEEE, pp. 347\u2013352 (2023).","DOI":"10.1109\/ITW55543.2023.10161676"},{"issue":"6","key":"1829_CR15","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":"1829_CR16","doi-asserted-by":"publisher","first-page":"149706","DOI":"10.1109\/ACCESS.2020.3016572","volume":"8","author":"J Hao","year":"2020","unstructured":"Hao J., Chen B.: On the generalized Hamming weights of $$(r, \\delta )$$-locally repairable codes. IEEE Access 8, 149706\u2013149713 (2020).","journal-title":"IEEE Access"},{"issue":"12","key":"1829_CR17","doi-asserted-by":"publisher","first-page":"7465","DOI":"10.1109\/TIT.2020.3021707","volume":"66","author":"J Hao","year":"2020","unstructured":"Hao J., Xia S., Shum K., Chen B., Fu F., Yang Y.: Bounds and constructions of locally repairable codes: parity-check matrix approach. IEEE Trans. Inf. Theory 66(12), 7465\u20137474 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1829_CR18","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/18.370144","volume":"41","author":"T Helleseth","year":"1995","unstructured":"Helleseth T., Klove T., Levenshtein V., Ytrehus \u00d8.: Bounds on the minimum support weights. IEEE Trans. Inf. Theory 41(2), 432\u2013440 (1995).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1829_CR19","first-page":"1008","volume":"2016","author":"H Sihuang","year":"2016","unstructured":"Sihuang H., Tamo I., Barg A.: Combinatorial and LP bounds for LRC codes. IEEE Int. Symposium Inform. Theory (ISIT) 2016, 1008\u20131012 (2016).","journal-title":"IEEE Int. Symposium Inform. Theory (ISIT)"},{"key":"1829_CR20","volume-title":"Fundamentals of error-correcting codes","author":"CW Huffman","year":"2023","unstructured":"Huffman C.W., Pless V.: Fundamentals of error-correcting codes. Cambridge University Press, Cambridge (2023)."},{"issue":"10","key":"1829_CR21","doi-asserted-by":"publisher","first-page":"6491","DOI":"10.1109\/TIT.2021.3103330","volume":"67","author":"X Kong","year":"2021","unstructured":"Kong X., Wang X., Ge G.: New constructions of optimal locally repairable codes with super-linear length. IEEE Trans. Inf. Theory 67(10), 6491\u20136506 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1829_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.2022.3203591","volume":"69","author":"G Luo","year":"2022","unstructured":"Luo G., Frederic Ezerman M., Ling S.: Three new constructions of optimal locally repairable codes from matrix-product codes. IEEE Trans. Inf. Theory 69(1), 75\u201385 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1829_CR23","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/j.1538-7305.1963.tb04003.x","volume":"42","author":"J MacWilliams","year":"1963","unstructured":"MacWilliams J.: A theorem on the distribution of weights in a systematic code. Bell Syst. Tech. J. 42(1), 79\u201394 (1963).","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"1829_CR24","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TIT.2019.2939464","volume":"66","author":"G Micheli","year":"2020","unstructured":"Micheli G.: Constructions of locally recoverable codes which are optimal. IEEE Trans. Inf. Theory 66(1), 167\u2013175 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1829_CR25","doi-asserted-by":"crossref","unstructured":"Prakash N., Kamath G., Lalitha V., Kumar P.: Optimal linear codes with a local-error-correction property, 2012 IEEE International Symposium on Information Theory Proceedings. IEEE, pp. 2776\u20132780 (2012).","DOI":"10.1109\/ISIT.2012.6284028"},{"issue":"9","key":"1829_CR26","doi-asserted-by":"publisher","first-page":"2035","DOI":"10.1007\/s10623-017-0436-3","volume":"86","author":"A Ravagnani","year":"2018","unstructured":"Ravagnani A.: Duality of codes supported on regular lattices, with an application to enumerative combinatorics. Des. Codes Crypt. 86(9), 2035\u20132063 (2018).","journal-title":"Des. Codes Crypt."},{"key":"1829_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13634-015-0292-0","volume":"2015","author":"AS Rawat","year":"2015","unstructured":"Rawat A.S., Mazumdar A., Vishwanath S.: Cooperative local repair in distributed storage. EURASIP J. Adv. Signal Process. 2015, 1\u201317 (2015).","journal-title":"EURASIP J. Adv. Signal Process."},{"key":"1829_CR28","unstructured":"Shum, K.\u00a0W., Hao, J.: Optimal quaternary (r, delta)-locally repairable codes achieving the singleton-type bound. arXiv:2112.05377 (2021)."},{"key":"1829_CR29","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0024-3795(93)00106-A","volume":"216","author":"J Simonis","year":"1995","unstructured":"Simonis J.: MacWilliams identities and coordinate partitions. Linear Algebra Appl. 216, 81\u201391 (1995).","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"1829_CR30","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","volume":"10","author":"R Singleton","year":"1964","unstructured":"Singleton R.: Maximum distance $$q$$-nary codes. IEEE Trans. Inf. Theory 10(2), 116\u2013118 (1964).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1829_CR31","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":"12","key":"1829_CR32","doi-asserted-by":"publisher","first-page":"6661","DOI":"10.1109\/TIT.2016.2555813","volume":"62","author":"I Tamo","year":"2016","unstructured":"Tamo I., Papailiopoulos D., Dimakis A.: Optimal locally repairable codes and connections to matroid theory. IEEE Trans. Inf. Theory 62(12), 6661\u20136671 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1829_CR33","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/18.133259","volume":"37","author":"V Wei","year":"1991","unstructured":"Wei V.: Generalized hamming weights for linear codes. IEEE Trans. Inf. Theory 37(5), 1412\u20131418 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1829_CR34","unstructured":"Xi, Y., Kong, X., Ge, G.: Optimal quaternary locally repairable codes attaining the singleton-like bound. arXiv:2206.05805 (2022)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01829-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-026-01829-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01829-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T06:19:52Z","timestamp":1780035592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-026-01829-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,25]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["1829"],"URL":"https:\/\/doi.org\/10.1007\/s10623-026-01829-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,25]]},"assertion":[{"value":"8 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2026","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"100"}}