{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:10:16Z","timestamp":1784301016093,"version":"3.55.0"},"reference-count":24,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2023,12,1]]},"DOI":"10.1587\/transfun.2023eal2026","type":"journal-article","created":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T22:14:10Z","timestamp":1685398450000},"page":"1589-1592","source":"Crossref","is-referenced-by-count":1,"title":["Optimal (&lt;i&gt;r&lt;\/i&gt;, \u03b4)-Locally Repairable Codes from Reed-Solomon Codes"],"prefix":"10.1587","volume":"E106.A","author":[{"given":"Lin-Zhi","family":"SHEN","sequence":"first","affiliation":[{"name":"College of Science, Civil Aviation University of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu-Jie","family":"WANG","sequence":"additional","affiliation":[{"name":"College of Science, Civil Aviation University of China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] H. Cai, C.L. Fan, Y. Miao, M. Schwartz, and X.H. Tang, \u201cOptimal locally repairable codes: An improved bound and constructions,\u201d IEEE Trans. Inf. Theory, vol.68, no.8, pp.5060-5074, 2022. 10.1109\/TIT.2022.3161613","DOI":"10.1109\/TIT.2022.3161613"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] B. Chen, S. Xia, J. Hao, and F.-W. Fu, \u201cConstructions of optimal cyclic (<i>r<\/i>, \u03b4) locally repairable codes,\u201d IEEE Trans. Inf. Theory, vol.64, no.4, pp.2499-2511, 2018. 10.1109\/tit.2017.2761120","DOI":"10.1109\/TIT.2017.2761120"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] B. Chen, W. Fang, S. Xia, and F.-W. Fu, \u201cConstructions of optimal (<i>r<\/i>, \u03b4) locally repairable codes via constacyclic codes,\u201d IEEE Trans. Commun., vol.67, no.8, pp.5253-5263, 2019. 10.1109\/tcomm.2019.2916085","DOI":"10.1109\/TCOMM.2019.2916085"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] B. Chen and J. Huang, \u201cA construction of optimal (<i>r<\/i>, \u03b4)-locally recoverable codes,\u201d IEEE Access, vol.7, pp.180349-180353, 2019. 10.1109\/access.2019.2957942","DOI":"10.1109\/ACCESS.2019.2957942"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] H. Chen, J. Weng, W. Luo, and L. Xu, \u201cLong optimal and small-defect LRC codes with unbounded minimum distances,\u201d IEEE Trans. Inf. Theory, vol.67, no.5, pp.2786-2792, 2021. 10.1109\/tit.2021.3052749","DOI":"10.1109\/TIT.2021.3052749"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] W. Fang and F.-W. Fu, \u201cOptimal cyclic (<i>r<\/i>, \u03b4) locally repairable codes with unbounded length,\u201d Finite Fields Their Appl., vol.63, 101650, 2020. 10.1016\/j.ffa.2020.101650","DOI":"10.1016\/j.ffa.2020.101650"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, \u201cOn the locality of codeword symbols,\u201d IEEE Trans. Inf. Theory, vol.58, no.11, pp.6925-6934, 2012. 10.1109\/tit.2012.2208937","DOI":"10.1109\/TIT.2012.2208937"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] S. Goparaju and R. Calderbank, \u201cBinary cyclic codes that are locally repairable,\u201d Proc. Int. Symp. Inf. Theory (ISIT), HI, USA, pp.676-680, 2014. 10.1109\/isit.2014.6874918","DOI":"10.1109\/ISIT.2014.6874918"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] J. Hao, S.-T. Xia, K.W. Shum, B. Chen, F.-W. Fu and Y. Yang, \u201cBounds and constructions of locally repairable codes: Parity-check matrix approach,\u201d IEEE Trans. Inf. Theory, vol.66, no.12, pp.7465-7474, 2020. 10.1109\/tit.2020.3021707","DOI":"10.1109\/TIT.2020.3021707"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] L. Jin, L. Ma, and C. Xing, \u201cConstruction of optimal locally repairable codes via automorphism groups of rational function fields,\u201d IEEE Trans. Inf. Theory, vol.66, no.1, pp.210-221, 2020. 10.1109\/tit.2019.2946637","DOI":"10.1109\/TIT.2019.2946637"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] L. Jin, \u201cExplicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight code,\u201d IEEE Trans. Inf. Theory, vol.65, no.8, pp.4658-4663, 2019. 10.1109\/tit.2019.2901492","DOI":"10.1109\/TIT.2019.2901492"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] C. Kim and J. No, \u201cNew constructions of binary and ternary locally repairable codes using cyclic codes,\u201d IEEE Commun. Lett., vol.22, no.2, pp.228-231, 2018. 10.1109\/lcomm.2017.2776141","DOI":"10.1109\/LCOMM.2017.2776141"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] X. Li, L. Ma, and C. Xing, \u201cOptimal locally repairable codes via elliptic curve,\u201d IEEE Trans. Inf. Theory, vol.65, no.1, pp.108-117, 2019. 10.1109\/tit.2018.2844216","DOI":"10.1109\/TIT.2018.2844216"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Y. Luo, C. Xing, and C. Yuan, \u201cOptimal locally repairable codes of distance 3 and 4 via cyclic codes,\u201d IEEE Trans. Inf. Theory, vol.65, no.2, pp.1048-1053, 2019. 10.1109\/tit.2018.2854717","DOI":"10.1109\/TIT.2018.2854717"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] N. Prakash, G.M. Kamath, V. Lalitha, and P.V. Kumar, \u201cOptimal linear codes with a local-error-correction property,\u201d Proc. Int. Symp. Inf. Theory (ISIT), Cambridge, MA, USA, pp.2776-2780, 2012. 10.1109\/isit.2012.6284028","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] J. Qiu, D. Zheng, and F.-W. Fu, \u201cNew constructions of optimal cyclic (<i>r<\/i>, \u03b4) locally repairable codes from their zeros,\u201d IEEE Trans. Inf. Theory, vol.67, no.3, pp.1596-1608, 2021. 10.1109\/tit.2020.3043759","DOI":"10.1109\/TIT.2020.3043759"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] N. Silberstein, A.S. Rawat, O. Koyluoglu, and S. Vishwanath, \u201cOptimal locally repairable codes via rank-metric codes,\u201d Proc. Int. Symp. Inform. Theory (ISIT), Istanbul, Turkey, pp.1819-1823, 2013. 10.1109\/isit.2013.6620541","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] W. Song, S.H. Dau, C. Yuen, and T.J. Li, \u201cOptimal locally repairable linear codes,\u201d IEEE J. Sel. Areas Commun., vol.32, no.5, pp.1019-1036, 2014. 10.1109\/jsac.2014.140521","DOI":"10.1109\/JSAC.2014.140521"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] Z. Sun, S. Zhu, and L. Wang, \u201cOptimal constacyclic locally repairable codes,\u201d IEEE Commun. Lett., vol.23, no.2, pp.206-209, 2019. 10.1109\/lcomm.2018.2884930","DOI":"10.1109\/LCOMM.2018.2884930"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] I. Tamo and A. Barg, \u201cA family of optimal locally recoverable codes,\u201d IEEE Trans. Inf. Theory, vol.60, no.8, pp.4661-4676, 2014. 10.1109\/tit.2014.2321280","DOI":"10.1109\/TIT.2014.2321280"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] I. Tamo, A. Barg, S. Goparaju, and R. Calderbank, \u201cCyclic LRC codes and their subfield subcodes,\u201d Proc. Int. Symp. Inform. Theory (ISIT), Hong Kong, China, pp.1262-1266, 2015. 10.1109\/isit.2015.7282658","DOI":"10.1109\/ISIT.2015.7282658"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] I. Tamo, A. Barg, S. Goparaju, and R. Calderbank, \u201cCyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes,\u201d Int. J. Inf. Coding Theory, vol.3, no.4, pp.345-364, 2016. 10.1504\/ijicot.2016.079496","DOI":"10.1504\/IJICOT.2016.079496"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] P. Tan, Z. Zhou, H. Yan, and U. Parampalli, \u201cOptimal cyclic locally repairable codes via cyclotomic polynomials,\u201d IEEE Commun. Lett., vol.23, no.2, pp.202-205, 2019. 10.1109\/lcomm.2018.2882849","DOI":"10.1109\/LCOMM.2018.2882849"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] A. Zeh and E. Yaakobi, \u201cOptimal linear and cyclic locally repairable codes over small fields,\u201d Proc. Inf. Theory Workshop (ITW), Jerusalem, Israel, pp.1-5, 2015. 10.1109\/itw.2015.7133123","DOI":"10.1109\/ITW.2015.7133123"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/12\/E106.A_2023EAL2026\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T04:06:27Z","timestamp":1701489987000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/12\/E106.A_2023EAL2026\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"references-count":24,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2023eal2026","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,1]]},"article-number":"2023EAL2026"}}