{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T23:10:00Z","timestamp":1780441800804,"version":"3.54.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T00:00:00Z","timestamp":1649462400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T00:00:00Z","timestamp":1649462400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001475","name":"nanyang technological university","doi-asserted-by":"publisher","award":["04INS000047C230GRT01"],"award-info":[{"award-number":["04INS000047C230GRT01"]}],"id":[{"id":"10.13039\/501100001475","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":[[2022,5]]},"DOI":"10.1007\/s10623-022-01040-4","type":"journal-article","created":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T11:02:46Z","timestamp":1649502166000},"page":"1271-1287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1482-4783","authenticated-orcid":false,"given":"Gaojun","family":"Luo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"San","family":"Ling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,4,9]]},"reference":[{"issue":"8","key":"1040_CR1","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. Inform. Theory 66(8), 4853\u20134868 (2020).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"1040_CR2","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. Inform. Theory 67(2), 686\u2013704 (2021).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"1040_CR3","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., Hao J., Fu F.: 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":"1","key":"1040_CR4","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., Hao J., Xia S., Fu F.: 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":"8","key":"1040_CR5","doi-asserted-by":"publisher","first-page":"5253","DOI":"10.1109\/TCOMM.2019.2916085","volume":"67","author":"B Chen","year":"2019","unstructured":"Chen B., Fang W., Xia S., Fu F.: Constructions of optimal $$(r,\\delta )$$ locally repairable codes via constacyclic codes. IEEE Trans. Commun. 67(8), 5253\u20135263 (2019).","journal-title":"IEEE Trans. Commun."},{"issue":"11","key":"1040_CR6","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"},{"key":"1040_CR7","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."},{"issue":"6","key":"1040_CR8","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"},{"issue":"13","key":"1040_CR9","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1049\/el:19700293","volume":"6","author":"P Farrell","year":"1970","unstructured":"Farrell P.: Linear binary anticodes. Electron. Lett. 6(13), 419\u2013421 (1970).","journal-title":"Electron. Lett."},{"issue":"11","key":"1040_CR10","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":"1040_CR11","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."},{"key":"1040_CR12","doi-asserted-by":"crossref","unstructured":"Goparaju S., Calderbank R.: Binary cyclic codes that are locally repairable. In: Proc. Int. Symp. Inf. Theory (ISIT), Honolulu, HI, USA, pp. 676\u2013680 (2014)","DOI":"10.1109\/ISIT.2014.6874918"},{"key":"1040_CR13","unstructured":"Guruswami V., Xing C., Yuan C.: How long can optimal locally repairable codes be? In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2018, August 20\u201322, 2018\u2014Princeton, NJ, USA, pp. 41:1\u201341:11 (2018)"},{"issue":"3","key":"1040_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0166-218X(93)90127-A","volume":"47","author":"N Hamada","year":"1993","unstructured":"Hamada N., Helleseth T., Ytrehus \u00d8.: A new class of nonbinary codes meeting the Griesmer bound. Discret. Appl. Math. 47(3), 219\u2013226 (1993).","journal-title":"Discret. Appl. Math."},{"issue":"11","key":"1040_CR15","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":"5","key":"1040_CR16","doi-asserted-by":"publisher","first-page":"2696","DOI":"10.1109\/TIT.2019.2891562","volume":"65","author":"H Liu","year":"2019","unstructured":"Liu H., Maouche Y.: Two or few-weight trace codes over over $${\\mathbb{F}}_q+u{\\mathbb{F}}_q$$. IEEE Trans. Inf. Theory 65(5), 2696\u20132703 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1040_CR17","doi-asserted-by":"crossref","unstructured":"Huang C., Chen M., Li J.: Pyramid codes: flexible schemes to trade space for access efficiency in reliable data storage systems. In: Proc. IEEE Int. Symp. Network Computing and Applications (NCA), pp. 79\u201386 (2007)","DOI":"10.1109\/NCA.2007.37"},{"issue":"11","key":"1040_CR18","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.: Binary linear locally repairable codes. IEEE Trans. Inf. Theory 62(11), 6268\u20136283 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1040_CR19","doi-asserted-by":"crossref","unstructured":"Hao J., Xia S., Chen B.: On the linear codes with $$(r,\\delta )$$ locality for distributed storage. In: Proc. IEEE International Conference on Communications (ICC), Paris, France, pp. 1\u20136 (2017)","DOI":"10.1109\/ICC.2017.7997028"},{"issue":"1","key":"1040_CR20","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/TIT.2019.2946637","volume":"66","author":"L Jin","year":"2020","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 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1040_CR21","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":"10","key":"1040_CR22","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":"1040_CR23","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"},{"key":"1040_CR24","volume-title":"Finite fields","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite fields. Cambridge University Press, Cambridge (1997)."},{"issue":"2","key":"1040_CR25","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":"1040_CR26","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.dam.2017.11.020","volume":"237","author":"G Luo","year":"2018","unstructured":"Luo G., Cao X., Xu G., Xu S.: A new class of optimal linear codes with flexible parameters. Discret. Appl. Math. 237, 126\u2013131 (2018).","journal-title":"Discret. Appl. Math."},{"issue":"8","key":"1040_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":"6","key":"1040_CR28","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1007\/s12095-017-0270-5","volume":"10","author":"G Luo","year":"2018","unstructured":"Luo G., Cao X.: Complete weight enumerators of three classes of linear codes. Cryptogr. Commun. 10(6), 1091\u20131108 (2018).","journal-title":"Cryptogr. Commun."},{"issue":"6","key":"1040_CR29","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1007\/s12095-017-0272-3","volume":"10","author":"G Luo","year":"2018","unstructured":"Luo G., Cao X.: Five classes of optimal two-weight linear codes. Cryptogr. Commun. 10(6), 1119\u20131135 (2018).","journal-title":"Cryptogr. Commun."},{"issue":"4","key":"1040_CR30","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."},{"issue":"2","key":"1040_CR31","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"},{"key":"1040_CR32","doi-asserted-by":"crossref","unstructured":"Silberstein N., Rawat A.S., Koyluoglu O., Vishwanath S.: Optimal locally repairable codes via rank-metric codes. In: Proc. Int. Symp. Inf. Theory (ISIT), pp. 1819\u20131823 (2013)","DOI":"10.1109\/ISIT.2013.6620541"},{"issue":"5","key":"1040_CR33","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. Select. Areas Commun. 32(5), 6925\u20136934 (2014).","journal-title":"IEEE J. Select. Areas Commun."},{"key":"1040_CR34","doi-asserted-by":"crossref","unstructured":"Silberstein N., Zeh A.: Optimal binary locally repairable codes via anticodes. In: Proc. IEEE Int. Symp. Inf. Theory, pp. 1247\u20131251 (2015)","DOI":"10.1109\/ISIT.2015.7282655"},{"key":"1040_CR35","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":"10","key":"1040_CR36","doi-asserted-by":"publisher","first-page":"6240","DOI":"10.1109\/TIT.2017.2742499","volume":"63","author":"M Shi","year":"2017","unstructured":"Shi M., Guan Y., Sol\u00e9 P.: Two new families of two-weight codes. IEEE Trans. Inf. Theory 63(10), 6240\u20136246 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1040_CR37","doi-asserted-by":"publisher","first-page":"2346","DOI":"10.1109\/LCOMM.2016.2614934","volume":"20","author":"M Shi","year":"2016","unstructured":"Shi M., Liu Y., Sol\u00e9 P.: Optimal two-weight codes from trace codes over $${\\mathbb{F}}_2+u{\\mathbb{F}}_2$$. IEEE Commun. Lett. 20(12), 2346\u20132349 (2016).","journal-title":"IEEE Commun. Lett."},{"issue":"5","key":"1040_CR38","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s12095-016-0206-5","volume":"9","author":"M Shi","year":"2017","unstructured":"Shi M., Wu R., Liu Y., Sol\u00e9 P.: Two and three weight codes over $${\\mathbb{F}}_p+u{\\mathbb{F}}_p$$. Cryptogr. Commun. 9(5), 637\u2013646 (2017).","journal-title":"Cryptogr. Commun."},{"issue":"8","key":"1040_CR39","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"},{"key":"1040_CR40","doi-asserted-by":"crossref","unstructured":"Tamo I., Barg A., Goparaju S., Calderbank R.: Cyclic LRC codes and their subfield subcodes. In: Proc. Int. Symp. Inf. Theory (ISIT), Hong Kong, China, pp. 1262\u20131266 (2015)","DOI":"10.1109\/ISIT.2015.7282658"},{"key":"1040_CR41","doi-asserted-by":"crossref","unstructured":"Tan P., Fan C., Ding C., Zhou Z.: The minimum linear locality of linear codes. arXiv:2102.00597 (2021)","DOI":"10.1007\/s10623-022-01099-z"},{"key":"1040_CR42","unstructured":"Xiang C.: It is indeed a fundamental construction of all linear codes. arXiv:1610.06355 (2016)"},{"issue":"1","key":"1040_CR43","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TIT.2018.2823704","volume":"65","author":"Z Zhou","year":"2019","unstructured":"Zhou Z., Tang C., Li X., Ding C.: Binary LCD codes and self-orthogonal codes from a generic construction. IEEE Trans. Inf. Theory 65(1), 16\u201327 (2019).","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-022-01040-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01040-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01040-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T06:58:36Z","timestamp":1675234716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01040-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,9]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1040"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01040-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,9]]},"assertion":[{"value":"29 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}