Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao
New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
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 …
New Efficient Mds Array Codes For Raid Part I: Reed-Solomon-Like Codes For Tolerating Three Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao, Jia-Chen Shen
New Efficient Mds Array Codes For Raid Part I: Reed-Solomon-Like Codes For Tolerating Three Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao, Jia-Chen Shen
Research Collection School Of Computing and Information Systems
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 …