A Practical Parity Scheme for Tolerating Triple Disk Failures in RAID Architectures
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
A multiple disk failure recovery scheme in RAID systems
Journal of Systems Architecture: the EUROMICRO Journal
One-to-Many: Context-Oriented Code for Concurrent Error Detection
Journal of Electronic Testing: Theory and Applications
| Hi-index | 754.84 |
A family of binary array codes of size (p-1)×n, with p a prime, correcting multiple column erasures is proposed. The codes coincide with a subclass of shortened Reed-Solomon codes and achieve the maximum possible correcting capability. Complexity of encoding and decoding is proportional to rnp, where r is the number of correctable erasures, i.e., is simpler than the Forney decoding algorithm. The length n of the codes is at most 2p-1, that is, twice as big as the length of the Blaum-Roth codes having comparable decoding complexity