{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T06:01:30Z","timestamp":1673157690613},"reference-count":21,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2023,1,1]]},"DOI":"10.1587\/transfun.2022eal2020","type":"journal-article","created":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T22:09:53Z","timestamp":1659478193000},"page":"78-82","source":"Crossref","is-referenced-by-count":0,"title":["Constructions of Optimal Single-Parity Locally Repairable Codes with Multiple Repair Sets"],"prefix":"10.1587","volume":"E106.A","author":[{"given":"Yang","family":"DING","sequence":"first","affiliation":[{"name":"Department of Mathematics, Shanghai University"}]},{"given":"Qingye","family":"LI","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Shanghai University"}]},{"given":"Yuting","family":"QIU","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Shanghai University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] B. Chen, W. Fang, S. Xia, J. Hao, and F. Fu, \u201cImproved bounds and singleton-optimal constructions of locally repairable codes with minimum distance 5 and 6,\u201d IEEE Trans. Inf. Theory, vol.67, no.1, pp.217-231, 2021. 10.1109\/TIT.2020.3036279","DOI":"10.1109\/TIT.2020.3036279"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] 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":"3","doi-asserted-by":"publisher","unstructured":"[3] G. Wang, M, Niu, and F. Fu, \u201cConstructions of (<i>r<\/i>, <i>t<\/i>)-LRC based on totally isotropic subspaces in symplectic space over finite fields,\u201d International Journal of Foundations of Computer Science, vol.31, no.3, pp.327-339, 2020. 10.1142\/s0129054120500112","DOI":"10.1142\/S0129054120500112"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] C. Huang, M. Chen, and J. Li, \u201cPyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems,\u201d IEEE Int. Symp. Netw. Comput., pp.79-86, 2007. 10.1109\/nca.2007.37","DOI":"10.1109\/NCA.2007.37"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] J. Hao and S. Xia, \u201cConstructions of optimal binary locally repairable codes with multiple repair groups,\u201d IEEE Commun. Lett., vol.20, no.6, pp.1060-1063, 2016. 10.1109\/lcomm.2016.2539160","DOI":"10.1109\/LCOMM.2016.2539160"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] J. Hao, S. Xia, and B. Chen, \u201cOn the single-parity locally repairable codes with availability,\u201d 2016 IEEE\/CIC International Conference on Communications in China, pp.1-4, 2016. 10.1109\/iccchina.2016.7636892","DOI":"10.1109\/ICCChina.2016.7636892"},{"key":"7","unstructured":"[7] C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin, \u201cErasure coding in windows azure storage,\u201d Proc. 2012 USENIX Conference on Annual Technical Conference, USENIX Association, Berkeley, 2012."},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] P. Huang, E. Yaakobi, U. Hironori, and P.H. Siegel, \u201cLinear locally repairable codes with availability,\u201d Proc. Int. Symp. Inf. Theory, Hong Kong, China, New York, pp.1871-1875, 2015. 10.1109\/isit.2015.7282780","DOI":"10.1109\/ISIT.2015.7282780"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] Y.J. Ionin and M.S. Shrikhande, Combinatorics of Symmetric Designs, Cambridge Univ. Press, Cambridge, 2006. 10.1017\/cbo9780511542992","DOI":"10.1017\/CBO9780511542992"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] L. Jin, \u201cExplicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes,\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":"11","doi-asserted-by":"publisher","unstructured":"[11] 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":"12","doi-asserted-by":"publisher","unstructured":"[12] G. Luo and X. Cao, \u201cConstructions of optimal binary locally recoverable codes via a general construction of linear codes,\u201d IEEE Trans. Commun., vol.69, no.8, pp.4987-4997, 2021. 10.1109\/tcomm.2021.3083320","DOI":"10.1109\/TCOMM.2021.3083320"},{"key":"13","unstructured":"[13] F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland Publishing Company, Amsterdam, 1981."},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] L. Ma and C. Xing, \u201cConstructive asymptotic bounds of locally repairable codes via function fields,\u201d IEEE Trans. Inf. Theory, vol.66, no.9, pp.5395-5403, 2020. 10.1109\/tit.2020.2970419","DOI":"10.1109\/TIT.2020.2970419"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] L. Pamies-Juarez, H.D.L. Hollmann, and F. Oggier, \u201cLocally repairable codes with multiple repair alternatives,\u201d Proc. Int. Symp. Inf. Theory, Istanbul, Turkey, pp.892-896, 2013. 10.1109\/isit.2013.6620355","DOI":"10.1109\/ISIT.2013.6620355"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] A.S. Rawat, D.S. Papailiopoulos, A.G. Dimakis, and S. Vishwanath, \u201cLocality and availability in distributed storage,\u201d IEEE Trans. Inf. Theory, vol.62, no.8, pp.4481-4493, 2016. 10.1109\/tit.2016.2524510","DOI":"10.1109\/TIT.2016.2524510"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] 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":"18","doi-asserted-by":"publisher","unstructured":"[18] C. Xing and S.L. Yeo, \u201cConstruction of global function fields from linear codes and vice versa,\u201d Trans. Am. Math. Soc., vol.361, no.3, pp.1333-1349, 2009. 10.1090\/s0002-9947-08-04710-7","DOI":"10.1090\/S0002-9947-08-04710-7"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] A. Wang and Z. Zhang, \u201cRepair locality with multiple erasure tolerance,\u201d IEEE Trans. Inf. Theory, vol.60, no.11, pp.6979-6987, 2014. 10.1109\/tit.2014.2351404","DOI":"10.1109\/TIT.2014.2351404"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] Y. Zhang and H. Kan, \u201cLocally repairable codes from combinatorial designs,\u201d Sci. China Inf. Sci., vol.63, 122304, 2020. 10.1007\/s11432-019-2649-5","DOI":"10.1007\/s11432-019-2649-5"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] Z. Zhang, J. Xu, and M. Liu, \u201cConstruction of optimal locally repairable codes over small fields,\u201d Sci. China Math., vol.47, no.11, pp.1607-1614, 2017 (in Chinese). 10.1360\/n012016-00206","DOI":"10.1360\/N012016-00206"}],"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\/1\/E106.A_2022EAL2020\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T03:14:35Z","timestamp":1673061275000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/1\/E106.A_2022EAL2020\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2022eal2020","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,1]]},"article-number":"2022EAL2020"}}