{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:44:29Z","timestamp":1740149069255,"version":"3.37.3"},"reference-count":22,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,7,15]],"date-time":"2021-07-15T00:00:00Z","timestamp":1626307200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100012542","name":"Sichuan Province Science and Technology Support Program","doi-asserted-by":"publisher","award":["2020YF0230","2020YFG0150","2020YFG0294"],"award-info":[{"award-number":["2020YF0230","2020YFG0150","2020YFG0294"]}],"id":[{"id":"10.13039\/100012542","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2021,7,15]]},"abstract":"<jats:p>The erasure codes are widely used in the distributed storage with low redundancy compared to the replication method. However, the current research studies about the erasure codes mainly focus on the encoding methods, while there are few studies on the decoding methods. In this paper, a novel erasure decoding method is proposed; it is a general decoding method and can be used both over the multivariate finite field and the binary finite field. The decoding of the failures can be realized based on the transforming process of the decoding transformation matrix, and it is convenient to avoid the overburdened visiting problem by tiny modification of the method. The correctness of the method is proved by the theoretical analysis; the experiments about the comparison with the traditional methods show that the proposed method has better decoding efficiency and lower reconstruction bandwidth.<\/jats:p>","DOI":"10.1155\/2021\/8755697","type":"journal-article","created":{"date-parts":[[2021,7,16]],"date-time":"2021-07-16T21:35:09Z","timestamp":1626471309000},"page":"1-12","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Decoding Method for the Erasure Codes"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3080-462X","authenticated-orcid":true,"given":"Dan","family":"Tang","sequence":"first","affiliation":[{"name":"Software Engineering Institute, Chengdu University of Information Technology, Chengdu 610225, China"},{"name":"Sichuan Key Laboratory of Software Automatic Generation and Intelligent Service, Chengdu 610225, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2219-2480","authenticated-orcid":true,"given":"Hongliang","family":"Cai","sequence":"additional","affiliation":[{"name":"Software Engineering Institute, Chengdu University of Information Technology, Chengdu 610225, China"},{"name":"Sichuan Key Laboratory of Software Automatic Generation and Intelligent Service, Chengdu 610225, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"issue":"6","key":"1","first-page":"44","article-title":"Erasure codes for storage systems: a brief primer","volume":"38","author":"J. S. Plank","year":"2013","journal-title":"Log in: the magazine of USENIX & SAGE"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"issue":"4","key":"3","first-page":"523","article-title":"A class of array erasure codes with high fault-tolerance","volume":"46","author":"D. Tang","year":"2016","journal-title":"Science China Information Sciences"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1002\/spe.631"},{"first-page":"173","article-title":"Optimizing cauchy reed-solomon codes for fault-tolerant network storage applications","author":"J. S. Plank","key":"5"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1002\/(sici)1097-024x(199709)27:9<995::aid-spe111>3.0.co;2-6"},{"issue":"1","key":"7","first-page":"43","article-title":"Research of methods for lost data reconstruction in erasure codes over binary fields","volume":"14","author":"D. Tang","year":"2016","journal-title":"Journal of electronic science and technology"},{"first-page":"299","article-title":"Screaming fast galois field arithmetic using intel SIMD instructions","author":"J. S. Plank","key":"8"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/18.746809"},{"author":"J. L. Hafner","key":"11","article-title":"WEAVER codes: highly fault tolerant erasure codes for storage systems"},{"first-page":"217","article-title":"HoVer erasure codes for disk arrays","author":"J. L. Hafner","key":"12"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/2560013"},{"issue":"9","key":"14","first-page":"1","article-title":"Random binary extensive code (RBEC): an efficient code for distributed storage system","volume":"40","author":"L. Chen","year":"2016","journal-title":"Chinese Journal of Computers"},{"author":"P. Corbett","key":"15","article-title":"Row-diagonal parity for double disk failure correction"},{"first-page":"307","article-title":"Highly available distributed storage systems","author":"L. Xu","key":"16"},{"volume-title":"An XOR-Based Erasure-Resilient Coding Scheme","year":"1995","author":"J. Blomer","key":"17"},{"author":"J. L. Hafner","key":"18","article-title":"Matrix methods for lost data reconstruction in erasure codes"},{"volume-title":"A Book of Abstract Algebra,","year":"1982","author":"C. C. Pinter","key":"19"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1080\/0025570x.1994.11996233"},{"volume-title":"Handbook of Coding Theory","year":"1998","author":"P. Vera","key":"21"},{"first-page":"2801","article-title":"Simple regenerating codes: network coding for cloud storage","author":"D. S. Papailiopoulos","key":"22"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/8755697.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/8755697.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/8755697.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,16]],"date-time":"2021-07-16T21:35:21Z","timestamp":1626471321000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2021\/8755697\/"}},"subtitle":[],"editor":[{"given":"Zhili","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,7,15]]},"references-count":22,"alternative-id":["8755697","8755697"],"URL":"https:\/\/doi.org\/10.1155\/2021\/8755697","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"type":"electronic","value":"1939-0122"},{"type":"print","value":"1939-0114"}],"subject":[],"published":{"date-parts":[[2021,7,15]]}}}