{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:31:43Z","timestamp":1778603503656,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T00:00:00Z","timestamp":1718236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T00:00:00Z","timestamp":1718236800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2020YFB1805404"],"award-info":[{"award-number":["2020YFB1805404"]}]},{"name":"National Key Research and Development Program of China","award":["2022YFA1005000"],"award-info":[{"award-number":["2022YFA1005000"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62171248"],"award-info":[{"award-number":["62171248"]}],"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":["62171400"],"award-info":[{"award-number":["62171400"]}],"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":["62301189"],"award-info":[{"award-number":["62301189"]}],"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":["62371259"],"award-info":[{"award-number":["62371259"]}],"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":["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":["61801049"],"award-info":[{"award-number":["61801049"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Science and Technology Program","award":["JCYJ20220818101012025"],"award-info":[{"award-number":["JCYJ20220818101012025"]}]},{"name":"the PCNL KEY project","award":["PCL2023AS6-1"],"award-info":[{"award-number":["PCL2023AS6-1"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10623-024-01409-7","type":"journal-article","created":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T15:03:15Z","timestamp":1718290995000},"page":"2685-2704","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal ternary locally repairable codes"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2032-665X","authenticated-orcid":false,"given":"Jie","family":"Hao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu-Tao","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth W.","family":"Shum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,13]]},"reference":[{"issue":"3\u20134","key":"1409_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system. I: the user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997).","journal-title":"J. Symb. Comput."},{"issue":"8","key":"1409_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).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1409_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).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1409_CR4","doi-asserted-by":"publisher","first-page":"2499","DOI":"10.1109\/TIT.2017.2761120","volume":"64","author":"B Chen","year":"2018","unstructured":"Chen B., Xia S.-T., Hao J., Fu F.-W.: Constructions of optimal cyclic $$(r,\\delta )$$ locally repairable codes. IEEE Trans. Inf. Theory 64(4), 2499\u20132511 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1409_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF00124590","volume":"9","author":"MA de Boer","year":"1996","unstructured":"de Boer M.A.: Almost MDS codes. Des. Codes Cryptogr. 9(2), 143\u2013155 (1996).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1409_CR6","first-page":"101","volume":"26","author":"SM Dodunekov","year":"1990","unstructured":"Dodunekov S.M.: A comment on the weight structure of generator matrices of linear codes. Probl. Inf. Transm. 26(2), 101\u2013104 (1990).","journal-title":"Probl. Inf. Transm."},{"issue":"1","key":"1409_CR7","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01222850","volume":"54","author":"S Dodunekov","year":"1995","unstructured":"Dodunekov S., Landgev I.: On near-MDS codes. J. Geom. 54(1), 30\u201343 (1995).","journal-title":"J. Geom."},{"issue":"1\u20133","key":"1409_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0012-365X(99)00168-5","volume":"213","author":"S Dodunekov","year":"2000","unstructured":"Dodunekov S., Landgev I.: Near-MDS codes over some small fields. Discret. Math. 213(1\u20133), 55\u201365 (2000).","journal-title":"Discret. Math."},{"issue":"11","key":"1409_CR9","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":"1409_CR10","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":"1409_CR11","doi-asserted-by":"crossref","unstructured":"Hao J., Shum K.W., Xia S.-T., Fu F.-W., Yang Y.: On optimal quaternary locally repairable codes. In: The IEEE International Symposium on Information Theory (ISIT), Melbourne, VIC, Australia, pp. 3267\u20133272 (2021).","DOI":"10.1109\/ISIT45174.2021.9518245"},{"key":"1409_CR12","doi-asserted-by":"crossref","unstructured":"Hao, J., Xia, S.-T., Chen, B.: On optimal ternary locally repairable codes. In: IEEE Int. Symp. Inf. Theory (ISIT), Aachen, Germany, pp. 171\u2013 175 ( 2017)","DOI":"10.1109\/ISIT.2017.8006512"},{"issue":"12","key":"1409_CR13","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.-T., Shum K.W., Chen B., Fu F.-W., 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":"5","key":"1409_CR14","doi-asserted-by":"publisher","first-page":"2895","DOI":"10.1109\/TCOMM.2022.3155165","volume":"70","author":"J Hao","year":"2022","unstructured":"Hao J., Zhang J., Xia S.-T., Fu F.-W., Yang Y.: Constructions and weight distributions of optimal locally repairable codes. IEEE Trans. Commun. 70(5), 2895\u20132908 (2022).","journal-title":"IEEE Trans. Commun."},{"issue":"11","key":"1409_CR15","doi-asserted-by":"publisher","first-page":"6268","DOI":"10.1109\/TIT.2016.2605119","volume":"62","author":"P Huang","year":"2016","unstructured":"Huang P., Yaakobi E., Uchikawa H., Siegel P.H.: Binary linear locally repairable codes. IEEE Trans. Inf. Theory 62(11), 6268\u20136283 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1409_CR16","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).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1409_CR17","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/TIT.2019.2946637","volume":"66","author":"L Jin","year":"2019","unstructured":"Jin L., Ma L., Xing C.: Construction of optimal locally repairable codes via automorphism groups of rational function fields. IEEE Trans. Inf. Theory 66(1), 210\u2013221 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1409_CR18","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TIT.2018.2844216","volume":"65","author":"X Li","year":"2019","unstructured":"Li X., Ma L., Xing C.: Optimal locally repairable codes via elliptic curves. IEEE Trans. Inf. Theory 65(1), 108\u2013117 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1409_CR19","doi-asserted-by":"publisher","first-page":"3302","DOI":"10.1109\/TCOMM.2020.2980837","volume":"68","author":"G Luo","year":"2020","unstructured":"Luo G., Cao X.: Optimal cyclic codes with hierarchical locality. IEEE Trans. Commun. 68(6), 3302\u20133310 (2020).","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"1409_CR20","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 infinite families of optimal locally repairable codes from matrix-product codes. IEEE Trans. Inf. Theory 69(1), 75\u201385 (2023).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1409_CR21","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).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1409_CR22","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"},{"key":"1409_CR23","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)."},{"issue":"10","key":"1409_CR24","doi-asserted-by":"publisher","first-page":"5843","DOI":"10.1109\/TIT.2014.2325570","volume":"60","author":"DS Papailiopoulos","year":"2014","unstructured":"Papailiopoulos D.S., Dimakis A.G.: Locally repairable codes. IEEE Trans. Inf. Theory 60(10), 5843\u20135855 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1409_CR25","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0021-9800(68)80067-5","volume":"5","author":"V Pless","year":"1968","unstructured":"Pless V.: On the uniqueness of the Golay codes. J. Combin. Theory 5(3), 215\u2013228 (1968).","journal-title":"J. Combin. Theory"},{"issue":"1","key":"1409_CR26","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0012-365X(92)90569-2","volume":"106","author":"V Pless","year":"1992","unstructured":"Pless V.: More on the uniqueness of the Golay codes. Discret. Math. 106(1), 391\u2013398 (1992).","journal-title":"Discret. Math."},{"issue":"8","key":"1409_CR27","doi-asserted-by":"publisher","first-page":"4481","DOI":"10.1109\/TIT.2016.2524510","volume":"62","author":"AS Rawat","year":"2016","unstructured":"Rawat A.S., Papailiopoulos 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"},{"issue":"2","key":"1409_CR28","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).","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"1409_CR29","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":"4","key":"1409_CR30","first-page":"345","volume":"3","author":"I Tamo","year":"2016","unstructured":"Tamo I., Barg A., Goparaju S., Calderbank R.: Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes. Int. J. Inf. Coding Theory 3(4), 345\u2013364 (2016).","journal-title":"Int. J. Inf. Coding Theory"},{"issue":"11","key":"1409_CR31","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"},{"issue":"10","key":"1409_CR32","doi-asserted-by":"publisher","first-page":"5280","DOI":"10.1109\/TIT.2015.2472515","volume":"61","author":"A Wang","year":"2015","unstructured":"Wang A., Zhang Z.: An integer programming-based bound for locally repairable codes. IEEE Trans. Inf. Theory 61(10), 5280\u20135294 (2015).","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-01409-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01409-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01409-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T16:12:48Z","timestamp":1723219968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01409-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,13]]},"references-count":32,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["1409"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01409-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,13]]},"assertion":[{"value":"17 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}