{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:50:24Z","timestamp":1740181824118,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62271044"],"award-info":[{"award-number":["62271044"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Open J. Commun. Soc."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/ojcoms.2024.3468873","type":"journal-article","created":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T17:49:35Z","timestamp":1727372975000},"page":"6329-6342","source":"Crossref","is-referenced-by-count":0,"title":["New Systematic MDS Array Codes With Two Parities"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9937-6498","authenticated-orcid":false,"given":"Lan","family":"Ma","sequence":"first","affiliation":[{"name":"School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9156-6856","authenticated-orcid":false,"given":"Liyang","family":"Zhou","sequence":"additional","affiliation":[{"name":"Network Technology Lab, Huawei Technologies Company Ltd., Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaoteng","family":"Liu","sequence":"additional","affiliation":[{"name":"Network Technology Lab, Huawei Technologies Company Ltd., Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0648-9164","authenticated-orcid":false,"given":"Xiangyu","family":"Chen","sequence":"additional","affiliation":[{"name":"Network Technology Lab, Huawei Technologies Company Ltd., Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3213-1569","authenticated-orcid":false,"given":"Qifu","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_31"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref3","article-title":"Array codes","volume-title":"Handbook of Coding Theory","author":"Blaum","year":"1998"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.165454"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.485722"},{"key":"ref7","first-page":"1","article-title":"Row-diagonal parity for double disk failure correction","volume-title":"Proc. 3rd USENIX Conf. File Storage Technol.","author":"Corbett"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.746809"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1542275.1542326"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2016.2576461"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1177\/1094342009106191"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2820007"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.200"},{"key":"ref14","article-title":"Cauchy MDS array codes with efficient decoding method","author":"Hou","year":"2016","journal-title":"arXiv:1611.09968"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.179343"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3390\/e24101499"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544839.ch14"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261569"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611512"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/REDUNDANCY52534.2021.9606450"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.746771"},{"article-title":"New superposition constructions of error-correcting coding","year":"2023","author":"Rui","key":"ref22"},{"issue":"1","key":"ref23","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Probl. Inf. Trans."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ITW55543.2023.10161610"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2905571"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICCC57788.2023.10233599"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2613085"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3300919"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2832624"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2890260"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1142\/9407"}],"container-title":["IEEE Open Journal of the Communications Society"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8782661\/10362961\/10695780.pdf?arnumber=10695780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T13:37:35Z","timestamp":1728567455000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10695780\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/ojcoms.2024.3468873","relation":{},"ISSN":["2644-125X"],"issn-type":[{"type":"electronic","value":"2644-125X"}],"subject":[],"published":{"date-parts":[[2024]]}}}