The Design And Implementation Of Fault-tolerant Algorithm For Data Storage Based On Reed-Solomon Coding

With the rapid development of the computer, the capacity of data processed increases day by day, the storage device also obtained swiftly development, these all need higher reliability. The Error-Correcting Code technology obtains higher reliability through the redundancy information. Along with the modern code algebra development, the Error-Correcting Code theory obtained the enormous application in the computer storage, specially in erasure or loss such as this block error. This article proposed the very good solution to this error. According to the RAID rank 6 (the P+Q redundant pattern), it can tolerate Q disks which are invalid.This thesis proposed two tables method's implementation in the field on the basis of the principle of the four operations in Galois Fields. The law of operations is simplified in Galois FieldsIn this thesis, the Reed-Solomon Code has been discussed in detail, and the BCH code has been discussed briefly.In this thesis, experimental data has been provided, that confirmed the theory discussed above. At the same time, the complexity of time to this Algorithm has been discussed in this paper.