Published February 2017
| Submitted
Journal Article
Open
Optimal Rebuilding of Multiple Erasures in MDS Codes
- Creators
- Wang, Zhiying
- Tamo, Itzhak
-
Bruck, Jehoshua
Chicago
An error occurred while generating the citation.
Abstract
Maximum distance separable (MDS) array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures. An MDS code with r redundancy nodes can correct any r node erasures by accessing (reading) all the remaining information in the surviving nodes. However, in practice, e erasures are a more likely failure event, for some 1≤e
Additional Information
© 2016 IEEE. Manuscript received March 3, 2016; accepted October 26, 2016. Date of publication November 29, 2016; date of current version January 18, 2017. This work was supported in part by the Israel Science Foundation under Grant 1030/15, in part by NSF-BSF under Grant 2015814, in part by the United States- Israel Binational Science Foundation under Grant 2010075, and in part by NSF under Grant CCF-1218005. The paper was partially presented at the 2011 Allerton Conference on Communication, Control, and Computing.Attached Files
Submitted - 1603.01213v1.pdf
Files
1603.01213v1.pdf
Files
(326.1 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:a91680809ba194b25dcfd5ebdc435bf9
|
326.1 kB | Preview Download |
Additional details
- Eprint ID
- 73541
- Resolver ID
- CaltechAUTHORS:20170119-080421044
- Created
-
2017-01-19Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field