Publication Type

Journal Article

Version

Postprint

Publication Date

9-2005

Abstract

This paper presents a class of binary maximum distance separable (MDS) array codes for tolerating disk failures in redundant arrays of inexpensive disks (RAID) architecture based on circular permutation matrices. The size of the information part is m×n, the size of the parity-check part is m×3, and the minimum distance is 4, where n is the number of information disks, the number of parity-check disks is 3, and (m+1) is a prime integer. In practical applications, m can be very large and n is from 20 to 50. The code rate is R=n/(n+3). These codes can be used for tolerating three disk failures. The encoding and decoding of the Reed-Solomon-like codes are very fast. There need to be 3mn XOR operations for encoding and (3mn+9(m+1)) XOR operations for decoding.

Keywords

Low-density-parity-check codes, MDS array codes, RAID, Reed-Solomon codes, multiple disk failures, information security

Discipline

Information Security

Research Areas

Information Security and Trust

Publication

IEEE Transactions on Computers

Volume

54

Issue

9

First Page

1071

Last Page

1080

ISSN

0018-9340

Identifier

10.1109/TC.2005.150

Publisher

IEEE

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.1109/TC.2005.150

Share

COinS