Loading...
Please wait, while we are loading the content...
Triple-star : a Coding Scheme with Optimal Encoding Complexity for Tolerating Triple Disk Failures
| Content Provider | Semantic Scholar |
|---|---|
| Author | Li, Guangjun Zhong, Xiuqin |
| Copyright Year | 2011 |
| Abstract | Low encoding/decoding complexity is essential for practical storage systems. This paper presents a new Maximum Distance Separable (MDS) array codes, called Triple-Star, for tolerating triple disk failures in Redundant Arrays of Inexpensive Disks (RAID) architecture. Triple-Star is an extension of the double-erasure-correcting Rotarycode and a modification of the generalized triple-erasure-correcting EVENODD code. We construct Triple-Star based on a bit matrix-vector product similar to the Reed-Solomon coding, and provide the geometry encoding method and detailed non-recursive decoding algorithms for correcting various triple node failures. The key novelty in Triple-Star is that it has optimal encoding complexity and lower decoding complexity comparing with existing comparable codes. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.ijicic.org/09-1059-1.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |