{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:37:23Z","timestamp":1762004243226,"version":"build-2065373602"},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61701115"],"award-info":[{"award-number":["61701115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grants Council of Hong Kong","award":["GRF 14216316"],"award-info":[{"award-number":["GRF 14216316"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/lcomm.2018.2820007","type":"journal-article","created":{"date-parts":[[2018,3,28]],"date-time":"2018-03-28T18:13:08Z","timestamp":1522260788000},"page":"1120-1123","source":"Crossref","is-referenced-by-count":19,"title":["A New Construction of EVENODD Codes With Lower Computational Complexity"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7328-9341","authenticated-orcid":false,"given":"Hanxu","family":"Hou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4501-4364","authenticated-orcid":false,"given":"Patrick P. C.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.746809"},{"key":"ref3","first-page":"1","article-title":"Row-diagonal parity for double disk failure correction","author":"corbett","year":"2004","journal-title":"Proc USENIX Conf File Storage Technol (FAST)"},{"key":"ref10","first-page":"688","article-title":"The EVENODD code and its generalization: An effcient scheme for tolerating multiple disk failures in RAID architectures","author":"blaum","year":"2002","journal-title":"High Performance Mass Storage and Parallel I\/O"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.78"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.746771"},{"key":"ref5","first-page":"97","article-title":"The RAID-6 liberation codes","author":"plank","year":"2008","journal-title":"Proc USENIX Conf File Storage Technol (FAST)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.57"},{"article-title":"C-codes: Cyclic lowest-density MDS array codes constructed using starters for RAID 6","year":"2012","author":"li","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2016.2576461"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CMPCON.1989.301912"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/8375700\/08327621.pdf?arnumber=8327621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:11:47Z","timestamp":1642003907000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8327621\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":11,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2018.2820007","relation":{},"ISSN":["1089-7798"],"issn-type":[{"type":"print","value":"1089-7798"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}