F-Code: An Optimized MDS Array Code

Based on the research of MDS array code of size n×n in distributed storage system, in this paper, we present a novel encoding scheme called the F-code and prove that the column distance of the F-code is 3, i.e. F-code is a MDS array code given that odd number n is greater than 3 and does not include factor 3. And we also implement a novel decoding algorithm of the F-code. The algorithm only needs two decoding chains in each linear equation group and is able to recover all unknown symbols on two erasure columns. The analysis of F-code shows that our method extends the range of number n in n×n MDS array code and gets lower/reduction algorithmic complexity. Therefore, the reliability of a distributed storage system that features the F-code can be effectively reinforced.

[1]  Kohichi Sakaniwa,et al.  Modified Low-Density MDS Array Codes for Tolerating Double Disk Failures in Disk Arrays , 2007, IEEE Transactions on Computers.

[2]  Xiaoyu Ruan,et al.  S-Code: new MDS array codes with optimal encoding , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[3]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[4]  Xiaoyu Ruan,et al.  S-code: new distance-3 MDS array codes , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[5]  Jehoshua Bruck,et al.  X-Code: MDS Array Codes with Optimal Encoding , 1999, IEEE Trans. Inf. Theory.

[6]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[7]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[8]  Alexander Vardy,et al.  MDS array codes with independent parity symbols , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[9]  Jehoshua Bruck,et al.  Computing in the RAIN: A Reliable Array of Independent Nodes , 2000, IEEE Trans. Parallel Distributed Syst..