{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:55:13Z","timestamp":1776956113220,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"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":["2021YFA1001000"],"award-info":[{"award-number":["2021YFA1001000"]}],"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":["2021YFA1001000"],"award-info":[{"award-number":["2021YFA1001000"]}],"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":["2021YFA1001000"],"award-info":[{"award-number":["2021YFA1001000"]}],"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":["2021YFA1001000"],"award-info":[{"award-number":["2021YFA1001000"]}],"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":["62201322"],"award-info":[{"award-number":["62201322"]}],"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":["62201322"],"award-info":[{"award-number":["62201322"]}],"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":["12201362"],"award-info":[{"award-number":["12201362"]}],"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":["12001322"],"award-info":[{"award-number":["12001322"]}],"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":["12001322"],"award-info":[{"award-number":["12001322"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2022QA031"],"award-info":[{"award-number":["ZR2022QA031"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2022QA031"],"award-info":[{"award-number":["ZR2022QA031"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2021QA043"],"award-info":[{"award-number":["ZR2021QA043"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2021QA043"],"award-info":[{"award-number":["ZR2021QA043"]}],"id":[{"id":"10.13039\/501100007129","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,12]]},"DOI":"10.1007\/s10623-024-01470-2","type":"journal-article","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T12:02:32Z","timestamp":1723464152000},"page":"3955-3979","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimal $$(2,\\delta )$$ locally repairable codes via punctured simplex codes"],"prefix":"10.1007","volume":"92","author":[{"given":"Yuan","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weijun","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingke","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sihuang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,12]]},"reference":[{"issue":"11","key":"1470_CR1","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). https:\/\/doi.org\/10.1109\/TIT.2015.2477406.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1470_CR2","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). https:\/\/doi.org\/10.1109\/TIT.2020.2977647.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1470_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/TIT.2020.3036279","volume":"67","author":"B Chen","year":"2021","unstructured":"Chen B., Fang W., Xia S.T., Hao J., Fu F.W.: Improved bounds and singleton-optimal constructions of locally repairable codes with minimum distance 5 and 6. IEEE Trans. Inf. Theory 67(1), 217\u2013231 (2021). https:\/\/doi.org\/10.1109\/TIT.2020.3036279.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1470_CR4","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). https:\/\/doi.org\/10.1109\/TIT.2007.896886.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1470_CR5","doi-asserted-by":"publisher","first-page":"5835","DOI":"10.1109\/TIT.2015.2473861","volume":"61","author":"K Ding","year":"2015","unstructured":"Ding K., Ding C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 61(11), 5835\u20135842 (2015). https:\/\/doi.org\/10.1109\/TIT.2015.2473861.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1470_CR6","doi-asserted-by":"publisher","unstructured":"Fang W., Chen B., Xia S.T., Fu F.W.: Singleton-optimal LRCs and perfect LRCs via cyclic codes. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 3261\u20133266 (2021). https:\/\/doi.org\/10.1109\/ISIT45174.2021.9517911.","DOI":"10.1109\/ISIT45174.2021.9517911"},{"key":"1470_CR7","doi-asserted-by":"publisher","unstructured":"Fang W., Chen B., Xia S.T., Fu F.W.: Bounds and constructions of singleton-optimal locally repairable codes with small localities. arXiv preprint (2022). arXiv:2207.05479. https:\/\/doi.org\/10.48550\/arXiv.2207.05479.","DOI":"10.48550\/arXiv.2207.05479"},{"issue":"11","key":"1470_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). https:\/\/doi.org\/10.1109\/TIT.2012.2208937.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1470_CR9","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). https:\/\/doi.org\/10.1109\/TIT.2019.2891765.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1470_CR10","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). https:\/\/doi.org\/10.1109\/TIT.2020.2993179.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1470_CR11","doi-asserted-by":"publisher","first-page":"4658","DOI":"10.1109\/TIT.2019.2901492","volume":"65","author":"L Jin","year":"2019","unstructured":"Jin L.: Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes. IEEE Trans. Inf. Theory 65(8), 4658\u20134663 (2019). https:\/\/doi.org\/10.1109\/TIT.2019.2901492.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1470_CR12","doi-asserted-by":"publisher","unstructured":"Lidl R., Niederreiter H.: Introduction to Finite Fields and their Applications, 2nd edn. Cambridge University Press, New York (1994). https:\/\/doi.org\/10.1017\/CBO9781139172769.","DOI":"10.1017\/CBO9781139172769"},{"issue":"8","key":"1470_CR13","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). https:\/\/doi.org\/10.1109\/TCOMM.2021.3083320.","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"1470_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.2022.3203591","volume":"69","author":"G Luo","year":"2023","unstructured":"Luo G., Ezerman M.F., Ling S.: Three new constructions of optimal locally repairable codes from matrix-product codes. IEEE Trans. Inf. Theory 69(1), 75\u201385 (2023). https:\/\/doi.org\/10.1109\/TIT.2022.3203591.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1470_CR15","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(5), 1271\u20131287 (2022). https:\/\/doi.org\/10.1007\/s10623-022-01040-4.","journal-title":"Des. Codes Cryptogr."},{"key":"1470_CR16","doi-asserted-by":"publisher","unstructured":"Prakash N., Kamath G.M., Lalitha V., Kumar P.V.: Optimal linear codes with a local-error-correction property. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 2776\u20132780 (2012). https:\/\/doi.org\/10.1109\/ISIT.2012.6284028.","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"1470_CR17","doi-asserted-by":"publisher","unstructured":"Qiu, J., Fu, F.W.: Some new constructions of optimal linear codes and alphabet-optimal ($$r, \\delta $$)-locally repairable codes. Des. Codes Cryptogr. (2024). https:\/\/doi.org\/10.1007\/s10623-024-01423-9.","DOI":"10.1007\/s10623-024-01423-9"},{"issue":"1","key":"1470_CR18","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), 1\u201317 (2015). https:\/\/doi.org\/10.1186\/s13634-015-0292-0.","journal-title":"EURASIP J. Adv. Signal Process."},{"key":"1470_CR19","doi-asserted-by":"publisher","unstructured":"Silberstein N., Zeh A.: Optimal binary locally repairable codes via anticodes. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 1247\u20131251 (2015). https:\/\/doi.org\/10.1109\/ISIT.2015.7282655.","DOI":"10.1109\/ISIT.2015.7282655"},{"issue":"2","key":"1470_CR20","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 Cryptogr. 86(2), 419\u2013445 (2018). https:\/\/doi.org\/10.1007\/s10623-017-0358-0.","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"1470_CR21","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). https:\/\/doi.org\/10.1109\/TIT.2014.2321280.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1470_CR22","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). https:\/\/doi.org\/10.1007\/s10623-022-01099-z.","journal-title":"Des. Codes Cryptogr."},{"key":"1470_CR23","doi-asserted-by":"publisher","unstructured":"Van\u00a0Lint J.H.: Introduction to Coding Theory. Springer, Berlin (1998). https:\/\/doi.org\/10.1007\/978-3-662-07998-0","DOI":"10.1007\/978-3-662-07998-0"},{"key":"1470_CR24","doi-asserted-by":"publisher","unstructured":"Wang D., Fang W., Hu S.: Optimal $$(2, \\delta )$$ locally repairable codes via punctured simplex codes. In: 2023 IEEE International Symposium on Information Theory (ISIT), pp. 1747\u20131752 (2023). https:\/\/doi.org\/10.1109\/ISIT54713.2023.10206909.","DOI":"10.1109\/ISIT54713.2023.10206909"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01470-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01470-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01470-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T21:22:57Z","timestamp":1732310577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01470-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,12]]},"references-count":24,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1470"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01470-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,12]]},"assertion":[{"value":"4 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 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":"There are no conflict of interest that are directly or indirectly related to the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}