Publication Type
Journal Article
Version
publishedVersion
Publication Date
12-2005
Abstract
A new class of Binary Maximum Distance Separable (MDS) array codes which are based on circular permutation matrices are introduced in this paper. These array codes are used for tolerating multiple (greater than or equal to 4) disk failures in Redundant Arrays of Inexpensive Disks (RAID) architecture. The size of the information part is m \times n, where n is the number of information disks and (m+1) is a prime integer; the size of the parity-check part is m \times r, the minimum distance is r+1, and the number of parity-check disks is r. In practical applications, m can be very large and n ranges from 20 to 50. The code rate is R = {\frac{n}{n+r}}. These codes can be used for tolerating up to r disk failures, with very fast encoding and decoding. The complexities of encoding and decoding algorithms are O(rmn) and O(m^3r^4), respectively. When r=4, there need to be 9mn XOR operations for encoding and (9n+95)(m+1) XOR operations for decoding.
Keywords
Rabin codes, MDS array codes, RAID, multiple disk failures
Discipline
Information Security
Research Areas
Information Security and Trust
Publication
IEEE Transactions on Computers
Volume
54
Issue
12
First Page
1473
Last Page
1483
ISSN
0018-9340
Identifier
10.1109/TC.2005.200
Publisher
IEEE
Citation
FENG, Gui-Liang; DENG, Robert H.; and Bao, Feng.
New efficient MDS array codes for RAID part II: Rabin-like codes for tolerating multiple (>=4) disk failures. (2005). IEEE Transactions on Computers. 54, (12), 1473-1483.
Available at: https://ink.library.smu.edu.sg/sis_research/1168
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1109/TC.2005.200