September 01, 2016
RAID-6 Reed-Solomon Codes with Near-Optimal Arithmetic Complexities
- Alloum A.
- Sian-Jheng Lin
- Tareq Y.Al-Naffouri
RAID-6 code is a class of [n=k + 2, k] systematic MDS codes to tolerate two failed drives. When RAID-6 is implemented by Reed-Solomon (RS), the penalty of the writing performance is on the field multiplications in the second parity. In this paper, we present a configuration of the factors of the secondparity formula, such that the arithmetic complexity can reach the optimal complexity bound when the code length approaches infinity. In the proposed approach, the intermediate data used for the first parity is also utilized to calculate the second parity. To the best of our knowledge, this is the first approach supporting the RAID-6 RS to approach the optimal arithmetic complexity.