{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T23:15:27Z","timestamp":1769728527607,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T00:00:00Z","timestamp":1716508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T00:00:00Z","timestamp":1716508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018YFA0704703"],"award-info":[{"award-number":["2018YFA0704703"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFA1005000"],"award-info":[{"award-number":["2022YFA1005000"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12141108"],"award-info":[{"award-number":["12141108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61971243"],"award-info":[{"award-number":["61971243"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12226336"],"award-info":[{"award-number":["12226336"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities of China","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100018769","name":"Nankai Zhide Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100018769","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":[[2024,10]]},"DOI":"10.1007\/s10623-024-01423-9","type":"journal-article","created":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T17:02:08Z","timestamp":1716570128000},"page":"2971-2991","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Some new constructions of optimal linear codes and alphabet-optimal $$(r,\\delta )$$-locally repairable codes"],"prefix":"10.1007","volume":"92","author":[{"given":"Jing","family":"Qiu","sequence":"first","affiliation":[]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,24]]},"reference":[{"key":"1423_CR1","unstructured":"Belov B.I.: A conjecture on the Griesmer bound. In: Proceedings of Optimization Methods and Their Applications, pp. 100\u2013106 (1972)."},{"issue":"11","key":"1423_CR2","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":"4","key":"1423_CR3","doi-asserted-by":"publisher","first-page":"2402","DOI":"10.1109\/TIT.2019.2944397","volume":"66","author":"H Cai","year":"2020","unstructured":"Cai H., Miao Y., Schwartz M., Tang X.: On optimal locally repairable codes with multiple disjoint repair sets. IEEE Trans. Inf. Theory 66(4), 2402\u20132416 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1423_CR4","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":"6","key":"1423_CR5","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1109\/TIT.2007.896886","volume":"53","author":"C Ding","year":"2007","unstructured":"Ding C., Niederreiter H.: Cyclotomic linear codes of order 3. IEEE Trans. Inf. Theory 53(6), 2274\u20132277 (2007).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1423_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1142\/9789812832245_0009","volume":"4","author":"C Ding","year":"2008","unstructured":"Ding C., Luo J., Niederreiter H.: Two-weight codes punctured from irreducible cyclic codes. Ser. Coding Theory Cryptol. 4, 119\u2013124 (2008).","journal-title":"Ser. Coding Theory Cryptol."},{"key":"1423_CR7","doi-asserted-by":"publisher","first-page":"215414","DOI":"10.1109\/ACCESS.2020.3040320","volume":"8","author":"Q Fu","year":"2020","unstructured":"Fu Q., Li R., Yang S.: Optimal $$(r,\\delta )$$-locally repairable codes from Simplex Code and Cap code. IEEE Access 8, 215414\u2013215418 (2020).","journal-title":"IEEE Access"},{"issue":"11","key":"1423_CR8","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":"5","key":"1423_CR9","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"JH Griesmer","year":"1960","unstructured":"Griesmer J.H.: A bound for error-correcting codes. IBM J. Res. Dev. 4(5), 532\u2013542 (1960).","journal-title":"IBM J. Res. Dev."},{"issue":"1\u20133","key":"1423_CR10","first-page":"229","volume":"116","author":"N Hamada","year":"1992","unstructured":"Hamada N.: A characterization of some $$[n, k, d; q]$$-codes meeting the Griesmer bound using a minihyper in a finite projective geometry. Discrete Math. 116(1\u20133), 229\u2013268 (1992).","journal-title":"Discrete Math."},{"issue":"2","key":"1423_CR11","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/S0019-9958(81)90184-4","volume":"50","author":"T Helleseth","year":"1980","unstructured":"Helleseth T.: A characterization of codes meeting the Griesmer bound. Inf. Control 50(2), 128\u2013159 (1980).","journal-title":"Inf. Control"},{"issue":"11","key":"1423_CR12","doi-asserted-by":"publisher","first-page":"6762","DOI":"10.1109\/TIT.2020.2993179","volume":"66","author":"JY Hyun","year":"2020","unstructured":"Hyun J.Y., Lee J., Lee Y.: Infinite families of optimal linear codes constructed from simplicial complexes. IEEE Trans. Inf. Theory 66(11), 6762\u20136773 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1423_CR13","doi-asserted-by":"publisher","first-page":"4156","DOI":"10.1109\/TIT.2019.2897705","volume":"65","author":"S Kruglik","year":"2019","unstructured":"Kruglik S., Nazirkhanova K., Frolov A.: New bounds and generalizations of locally recoverable codes with availability. IEEE Trans. Inf. Theory 65(7), 4156\u20134166 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1423_CR14","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TIT.2018.2854717","volume":"65","author":"Y Luo","year":"2019","unstructured":"Luo Y., Xing C., Yuan C.: Optimal locally repairable codes of distance $$3$$ and $$4$$ via cyclic codes. IEEE Trans. Inf. Theory 65(2), 1048\u20131053 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1423_CR15","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."},{"key":"1423_CR16","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1007\/s10623-022-01040-4","volume":"90","author":"G Luo","year":"2022","unstructured":"Luo G., Ling S.: Application of optimal $$p$$-ary linear codes to alphabet-optimal locally repairable codes. Des. Codes Cryptogr. 90, 1271\u20131287 (2022).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1423_CR17","doi-asserted-by":"publisher","first-page":"2509","DOI":"10.1137\/19M1248443","volume":"33","author":"J Ma","year":"2019","unstructured":"Ma J., Ge G.: Optimal binary linear locally repairable codes with disjoint repair groups. SIAM J. Discret. Math. 33(4), 2509\u20132529 (2019).","journal-title":"SIAM J. Discret. Math."},{"key":"1423_CR18","doi-asserted-by":"crossref","unstructured":"Pamies-Juarez L., Hollmann H.D., Oggier F.: Locally repairable codes with multiple repair alternatives. In: Proceedings of IEEE International Symposium on Information Theory, pp. 892\u2013896 (2013).","DOI":"10.1109\/ISIT.2013.6620355"},{"key":"1423_CR19","doi-asserted-by":"crossref","unstructured":"Prakash N., Kamath G.M., Lalitha V., Kumar P.V.: Optimal linear codes with a local-error-correction property. In: Proceedings of IEEE International Symposium on Information Theory, pp. 2776\u20132780 (2012).","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"1423_CR20","doi-asserted-by":"publisher","first-page":"107","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, 107 (2015).","journal-title":"EURASIP J. Adv. Signal Process."},{"issue":"8","key":"1423_CR21","doi-asserted-by":"publisher","first-page":"4481","DOI":"10.1109\/TIT.2016.2524510","volume":"62","author":"AS Rawat","year":"2016","unstructured":"Rawat A.S., Papailopoulos D.S., Dimakis A.G., Vishwanath S.: Locality and availability in distributed storage. IEEE Trans. Inf. Theory 62(8), 4481\u20134493 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1423_CR22","doi-asserted-by":"crossref","unstructured":"Silberstein N., Zeh A.: Optimal binary locally repairable codes via anticodes. In: Proceedings of IEEE International Symposium on Information Theory, pp. 1247\u20131251 (2015).","DOI":"10.1109\/ISIT.2015.7282655"},{"key":"1423_CR23","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10623-017-0358-0","volume":"86","author":"N Silberstein","year":"2018","unstructured":"Silberstein N., Zeh A.: Anticode-based locally repairable codes with high availability. Des. Codes Crypt. 86, 419\u2013445 (2018).","journal-title":"Des. Codes Crypt."},{"issue":"5","key":"1423_CR24","doi-asserted-by":"publisher","first-page":"2648","DOI":"10.1109\/TIT.2018.2876421","volume":"65","author":"N Silberstein","year":"2019","unstructured":"Silberstein N., Etzion T., Schwartz M.: Locality and availability of array codes constructed from subspaces. IEEE Trans. Inf. Theory 65(5), 2648\u20132660 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1423_CR25","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/S0019-9958(65)90080-X","volume":"8","author":"G Solomon","year":"1965","unstructured":"Solomon G., Stiffler J.J.: Algebraically punctured cyclic codes. Inf. Control 8(2), 170\u2013179 (1965).","journal-title":"Inf. Control"},{"issue":"8","key":"1423_CR26","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":"1423_CR27","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":"1423_CR28","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, 83\u2013114 (2023).","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"1423_CR29","doi-asserted-by":"publisher","first-page":"6979","DOI":"10.1109\/TIT.2014.2351404","volume":"60","author":"A Wang","year":"2014","unstructured":"Wang A., Zhang Z.: Repair locality with multiple erasure tolerance. IEEE Trans. Inf. Theory 60(11), 6979\u20136987 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1423_CR30","unstructured":"Xiang C.: It is indeed a fundamental construction of all linear codes. arXiv:1610.06355 (2016)."},{"issue":"7","key":"1423_CR31","doi-asserted-by":"publisher","first-page":"4320","DOI":"10.1109\/TIT.2022.3157612","volume":"68","author":"C Xing","year":"2022","unstructured":"Xing C., Yuan C.: Construction of optimal $$(r, \\delta )$$-locally recoverable codes and connection with graph theory. IEEE Trans. Inf. Theory 68(7), 4320\u20134328 (2022).","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-024-01423-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01423-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01423-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T20:18:29Z","timestamp":1726690709000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01423-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,24]]},"references-count":31,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1423"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01423-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,24]]},"assertion":[{"value":"6 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 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":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}