By Topic

New efficient MDS array codes for RAID. Part II. Rabin-like codes for tolerating multiple (≥ 4) disk failures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Gui-Liang Feng ; Center for Adv. Comput. Studies, Univ. of Louisiana, Lafayette, LA, USA ; Deng, R.H. ; Feng Bao ; Shen, J.-C.

For pt.1 see ibid., vol.54, no.9, p.1071-1080 (2005). 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 (≥ 4) disk failures in redundant arrays of inexpensive disks (RAID) architecture. The size of the information part is m × 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 × 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 = 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(m3r4), respectively. When r = 4, there need to be 9mn XOR operations for encoding and (9n + 95)(m + 1) XOR operations for decoding.

Published in:

Computers, IEEE Transactions on  (Volume:54 ,  Issue: 12 )