PROJECT TITLE :

A New Construction of EVENODD Codes With Lower Computational Complexity - 2018

ABSTRACT:

EVENODD codes are binary array codes for correcting double disk failures in RAID-half-dozen with asymptotically optimal encoding and decoding complexities. However, the update complexity of EVENODD is sub-optimal. We tend to propose a brand new construction of binary most distance separable array codes, specifically EVENODD+, such that the encoding, decoding, and update complexities of EVENODD+ are less than those of EVENODD normally. Moreover, EVENODD+ achieves asymptotically optimal update complexity.