{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:04Z","timestamp":1773378004855,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834665","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2184-2189","source":"Crossref","is-referenced-by-count":8,"title":["New constructions of binary MDS array codes and locally repairable array codes"],"prefix":"10.1109","author":[{"given":"Jingjie","family":"Lv","sequence":"first","affiliation":[{"name":"Tsinghua University,Tsinghua Shenzhen International Graduate School,Shenzhen,China,518055"}]},{"given":"Weijun","family":"Fang","sequence":"additional","affiliation":[{"name":"Shandong University,School of Cyber Science and Technology,Qingdao,China,266237"}]},{"given":"Bin","family":"Chen","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,Department of Computer Science and Technology,Shenzhen,China,518055"}]},{"given":"Shu-Tao","family":"Xia","sequence":"additional","affiliation":[{"name":"Tsinghua University,Tsinghua Shenzhen International Graduate School,Shenzhen,China,518055"}]},{"given":"Xiangyu","family":"Chen","sequence":"additional","affiliation":[{"name":"HUAWEI Technologies Co., Ltd.,Shenzhen,China,518055"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541337"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761120"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2911286"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2951693"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.959257"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00350-4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831861"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.746771"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2569077"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620354"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2923992"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261569"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.179343"},{"key":"ref2","first-page":"1855","article-title":"Chapter on array codes","volume":"2","author":"blaum","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849618"},{"key":"ref1","article-title":"A solution to the network challenges of data recovery in erasure-coded distributed storage systems: a study on the facebook warehouse cluster","author":"rashmi","year":"2013","journal-title":"5th USENIX Workshop on Hot Topics in Storage and File Systems"},{"key":"ref20","first-page":"1","article-title":"An encoding algorithm of triply extended Reed-Solomon codes with asymptotically optimal complexities","author":"lin","year":"2017","journal-title":"IEEE Trans Communi"},{"key":"ref22","author":"lidl","year":"1997","journal-title":"Finite Fields"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2019.2963827"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"ref23","first-page":"360","article-title":"P-Code: A new RAID-6 code with optimal properties","author":"chao","year":"2009","journal-title":"In the 23rd ACM International Conference on Supercomputing (ICS09)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2006.881361"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834665.pdf?arnumber=9834665","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:51Z","timestamp":1773347751000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834665\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834665","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}