Repairing Triple Data Erasure with Extending Row Diagonal Parity

Abstract

With the advent of the Big Data era, the amount of data stored has increased exponentially in recent years. In such an era, data storage security has become a significant challenge. As the volume of data increases, many data erasures during storage are inevitable. There has been a lot of research into dual fault-tolerant error correction code methods. EVENODD codes, Row Diagonal Parity (RDP) codes, and Horizontal-Diagonal Parity (HDP) codes can implement dual fault-tolerant data distribution. These self-correction codes allow up to two parts of the source code to be erased and the erased parts to be recovered. However, in many cases, it is not enough to fix two figures. This paper focuses on Extending Row Diagonal Parity (E-RDP) to cope with three or more data erasures. This data structure can efficiently recover three erasures based on RDP, which inherits the advantages of RDP. This article will explain the encoding process of E-RDP in detail, show an intuitive decoding method, and discuss the performance of E-RDP at the end.