New efficient MDS array codes for RAID part II: Rabin-like codes for tolerating multiple (>=4) disk failures
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...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2005
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1168 https://ink.library.smu.edu.sg/context/sis_research/article/2167/viewcontent/New_efficient_MDS_array_codes_for_RAID_part_II_Rabin_like_codes_for_tolerating_multiple.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |