A New Maximum Distance Separable Array Code on Toleration Triple Failures
Wan Wu-na · Journal of Chinese Computer Systems · 2013
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 M aximum 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 softw are and hardw are for simple structure. The M aximum Distance Separable property is theoretically proven. It is optimal in storage efficiency among triple erasure-correcting codes. The theoretical analysis show s that the comprehensive properties of the proposed code are better than other popular M DS codes,such as encoding and decoding efficiency,small w rites and balance performance.