Low complexity array codes for random triple failures in distributed storage system

作者：Jiang Haibo^*; Fan Mingyu; Wang Xiaojing; Xiao Yilong

来源：Journal of Convergence Information Technology, 2012, 7(23): 247-255.

DOI：10.4156/jcit.vol7.issue23.29

• Array codes
• Cluster storage systems
• Data redundancy
• Distributed storage system
• Encoding and decoding
• Erasure correcting
• Low-complexity
• Maximal distance separable
• Storage systems
• Triple
• XOR operation

A new low-complexity array codes is proposed for correcting random triple column erasures. The new array code is an extension of the double erasure correcting EVEN-ODD code, which is named NEW-ENOD code. The NEW-ENOD code is a maximal distance separable code. The encoding and decoding complexity of the NEW-ENOD code is lower than other of the existing comparable codes. Thus the NEW-ENOD code is practically very meaningful for RAID or other cluster storage systems that need lower data redundancy and higher reliability.

• 出版日期2012
• 单位电子科技大学