{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T05:14:01Z","timestamp":1747458841358,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T00:00:00Z","timestamp":1668384000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T00:00:00Z","timestamp":1668384000000},"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 R &D Program of China","doi-asserted-by":"crossref","award":["2021YFA1001000","2018YFA0704703"],"award-info":[{"award-number":["2021YFA1001000","2018YFA0704703"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62171248","61971243"],"award-info":[{"award-number":["62171248","61971243"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Fundamental Research Funds for the Central Universities, Nankai University"},{"name":"the Natural Science Foundation of Tianjin","award":["20JCZDJC00610"],"award-info":[{"award-number":["20JCZDJC00610"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12141108","62201322"],"award-info":[{"award-number":["12141108","62201322"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies","award":["2022B1212010005"],"award-info":[{"award-number":["2022B1212010005"]}]},{"DOI":"10.13039\/501100021171","name":"Guangdong Basic and Applied Basic Research Foundation","doi-asserted-by":"crossref","award":["2021A1515110066"],"award-info":[{"award-number":["2021A1515110066"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"crossref"}]},{"name":"PCNL KEY project","award":["PCL2021A07"],"award-info":[{"award-number":["PCL2021A07"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10623-022-01148-7","type":"journal-article","created":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T18:02:46Z","timestamp":1668448966000},"page":"1209-1232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Perfect LRCs and k-optimal LRCs"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4121-290X","authenticated-orcid":false,"given":"Weijun","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu-Tao","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangyu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,14]]},"reference":[{"issue":"5","key":"1148_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"},{"issue":"11","key":"1148_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":"1","key":"1148_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TCOMM.2018.2869800","volume":"67","author":"H Cai","year":"2019","unstructured":"Cai H., Cheng M., Fan C., Tang X.: Optimal locally repairable systematic codes based on packings. IEEE Trans. Commun. 67(1), 39\u201349 (2019).","journal-title":"IEEE Trans. Commun."},{"issue":"8","key":"1148_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":"2","key":"1148_CR5","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/TIT.2020.3037268","volume":"67","author":"H Cai","year":"2021","unstructured":"Cai H., Schwartz M.: On optimal locally repairable codes and generalized sector-disk codes. IEEE Trans. Inf. Theory 67(2), 686\u2013704 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1148_CR6","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780199298853.001.0001","volume-title":"Projective Geometry: An Introduction","author":"R Casse","year":"2006","unstructured":"Casse R.: Projective Geometry: An Introduction. Oxford University Press, New York (2006)."},{"key":"1148_CR7","volume-title":"Handbook of Combinatorial Designs","author":"CJ Charles","year":"2006","unstructured":"Charles C.J., Dinitz J.H.: Handbook of Combinatorial Designs. CRC Press, Boca Raton (2006)."},{"issue":"1","key":"1148_CR8","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"},{"key":"1148_CR9","doi-asserted-by":"crossref","unstructured":"Chen B., Xia S.-T., Hao J.: Improved bounds and optimal constructions of locally repairable codes with distance 5 and 6. In: Proc. Int. Symp. Inf. Theory (ISIT), pp. 2823\u20132827 (2019).","DOI":"10.1109\/ISIT.2019.8849478"},{"key":"1148_CR10","volume-title":"Codes from Difference Sets","author":"C Ding","year":"2015","unstructured":"Ding C.: Codes from Difference Sets. World Scientific, Singapore (2015)."},{"key":"1148_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.dam.2015.01.024","volume":"186","author":"T Etzion","year":"2015","unstructured":"Etzion T., Raviv N.: Equidistant codes in the Grassmannian. Discret. Appl. Math. 186, 87\u201397 (2015).","journal-title":"Discret. Appl. Math."},{"key":"1148_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10623-015-0156-5","volume":"78","author":"T Etzion","year":"2016","unstructured":"Etzion T., Storme L.: Galois geometries and coding theory. Des. Codes Cryptogr. 78, 311\u2013350 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"1148_CR13","doi-asserted-by":"crossref","unstructured":"Fang W., Chen B., Xia S.-T., Fu F.-W.: Complete characterization of optimal LRCs with minimum distance 6 and locality 2: improved bounds and constructions. In: Proc. Int. Symp. Inf. Theory (ISIT), pp. 595\u2013599 (2020).","DOI":"10.1109\/ISIT44484.2020.9174347"},{"key":"1148_CR14","doi-asserted-by":"crossref","unstructured":"Fang W., Chen B., Xia S.-T., Fu F.-W.: Perfect LRCs and $$k$$-optimal LRCs. In: Proc. Int. Symp. Inf. Theory (ISIT), pp. 600\u2013604 (2020).","DOI":"10.1109\/ISIT44484.2020.9173958"},{"issue":"11","key":"1148_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"},{"key":"1148_CR16","doi-asserted-by":"crossref","unstructured":"Goparaju S., Calderbank R.: Binary cyclic codes that are locally repairable. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 676\u2013680 (2014).","DOI":"10.1109\/ISIT.2014.6874918"},{"issue":"10","key":"1148_CR17","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., Westerback 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"},{"issue":"6","key":"1148_CR18","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\u202f? IEEE Trans. Inf. Theory 65(6), 3662\u20133670 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1148_CR19","doi-asserted-by":"crossref","unstructured":"Hao J., Xia S.-T., Chen B.: Some results on optimal locally repairable codes. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 440\u2013444 (2016).","DOI":"10.1109\/ISIT.2016.7541337"},{"key":"1148_CR20","doi-asserted-by":"crossref","unstructured":"Hao J., Xia S.-T., Chen B.: On optimal ternary locally repairable codes. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 171\u2013175 (2017).","DOI":"10.1109\/ISIT.2017.8006512"},{"issue":"12","key":"1148_CR21","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"},{"key":"1148_CR22","volume-title":"Projective Geometries Over Finite Fields","author":"JWP Hirschfeld","year":"1979","unstructured":"Hirschfeld J.W.P.: Projective Geometries Over Finite Fields. Oxford University Press, Oxford (1979)."},{"issue":"11","key":"1148_CR23","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":"1148_CR24","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":"1148_CR25","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":"1148_CR26","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":"8","key":"1148_CR27","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":"2","key":"1148_CR28","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":"1148_CR29","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)."},{"key":"1148_CR30","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: Proc. Int. Symp. Inf. Theory (ISIT), pp. 2776\u20132780 (2012).","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"1148_CR31","doi-asserted-by":"publisher","first-page":"6925","DOI":"10.1109\/JSAC.2014.140521","volume":"32","author":"W Song","year":"2014","unstructured":"Song W., Day S., Yuen C., Li T.: Optimal locally repairable linear codes. IEEE J. Sel. Areas Commun. 32, 6925\u20136934 (2014).","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"12","key":"1148_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.S., Dimakis A.G.: 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":"2","key":"1148_CR33","doi-asserted-by":"publisher","first-page":"333","DOI":"10.3934\/amc.2020024","volume":"14","author":"A Tebbi","year":"2019","unstructured":"Tebbi A., Chan T., Sung C.: Linear programming bounds for distributed storage codes. Adv. Math. Commun. 14(2), 333\u2013357 (2019).","journal-title":"Adv. Math. Commun."},{"key":"1148_CR34","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0124010","volume":"24","author":"A Tiet\u00e4v\u00e4inen","year":"1973","unstructured":"Tiet\u00e4v\u00e4inen A.: On the nonexistence of perfect codes over finite fields. SIAM J. Appl. Math. 24, 88\u201396 (1973).","journal-title":"SIAM J. Appl. Math."},{"key":"1148_CR35","unstructured":"Van Lint J.H.: Nonexistence theorems for perfect error-correcting codes. In: Computers in Algebra and Theory, vol. IV (SIAM-AMS Proceedings) (1971)."},{"issue":"10","key":"1148_CR36","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"},{"issue":"7","key":"1148_CR37","doi-asserted-by":"publisher","first-page":"4167","DOI":"10.1109\/TIT.2019.2895315","volume":"65","author":"A Wang","year":"2019","unstructured":"Wang A., Zhang Z., Lin D.: Bounds and constructions for linear locally repairable codes over binary fields. IEEE Trans. Inf. Theory 65(7), 4167\u20134179 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1148_CR38","doi-asserted-by":"publisher","first-page":"7333","DOI":"10.1109\/TIT.2020.2977636","volume":"66","author":"G Zhang","year":"2020","unstructured":"Zhang G., Liu H.: Constructions of optimal codes with hierarchical locality. IEEE Trans. Inf. Theory 66(12), 7333\u20137340 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1148_CR39","first-page":"26","volume":"8","author":"VA Zinov\u00e9v","year":"1972","unstructured":"Zinov\u00e9v V.A., Leont\u00e9v V.K.: On perfect codes. Probl. Peredachi Inform. 8, 26\u201335 (1972) (in Russian).","journal-title":"Probl. Peredachi Inform."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01148-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01148-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01148-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T20:21:12Z","timestamp":1701375672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01148-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,14]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1148"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01148-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,11,14]]},"assertion":[{"value":"19 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}