Abstract：With the development of massive storage system, the data placements base on toleration double failures can not meet the requirement of the reliability in storage systems. On the basis of the Row Diagonal Parity code for double toleration failures, a new class of Maximum Distance Separable array codes for triple failures is presented by adding a redundancy parity column. The algorithms of decoding are directly depicted by binary matrix transformation, and more easily implemented by software and hardware for simple structure. The Maximum Distance Separable property is theoretically proven. It is optimal in storage efficiency among triple erasure-correcting codes. The theoretical analysis shows that the comprehensive properties of the proposed code are better than other popular MDS codes, such as encoding and decoding efficiency, small writes and balance performance.
万武南，索望，王拓，杨威. 一种新的三容错最大距离可分阵列码[J]. , 2013, 34(10): 2267-2271.
WAN Wu-nan, SUO Wang, WANG Tuo, YANG Wei. A New Maximum Distance Separable Array Code on Toleration Triple Failures. , 2013, 34(10): 2267-2271.
