Extended EVENODD+ Codes with Asymptotically Optimal Updates and Efficient Encoding/Decoding
Hong Jie Fu, Hanxu Hou, Li Zhang · 2021
Extended EVENODD (EEOD) codes are binary maximum distance separable (MDS) array codes that can correct any three-column failures. However, the update complexity of EEOD codes is sub-optimal. In this paper, we propose Extended EVENODD+ (EEOD+) codes, of which the update complexity is asymptotically optimal. In addition, we present efficient encoding/decoding method for the EEOD+ codes. We show that our EEOD+ codes have less computational complexity than EEOD codes, in terms of encoding/decoding/update.