New EVENODD+ Codes with More Flexible Parameters and Lower Complexity

TL;DR

This paper introduces a new construction of EVENODD+ codes that offers more flexible parameters and reduces complexity, enhancing their applicability for RAID-6 systems with double disk failure correction.

Contribution

The paper presents a novel construction of EVENODD+ codes allowing flexible bits per disk and lower complexities than previous versions.

Findings

Codes have more flexible parameters for bits per disk.

Encoding, decoding, and update complexities are lower.

Codes maintain asymptotic optimality in complexity.

Abstract

EVENODD+ codes are binary maximum distance separable (MDS) array codes for correcting double disk failures in RAID-6 with asymptotically optimal encoding/decoding/update complexities. However, the number of bits stored in each disk of EVENODD+ codes should be an odd number minus one. In this paper, we present a new construction of EVENODD+ codes that have more flexible parameters. The number of bits stored in each disk of our codes is an odd minus one times any positive integer. Moreover, our codes not only have asymptotically optimal encoding/decoding/update complexities but also have lower encoding/decoding/update complexities than the existing EVENODD+ codes.