New Efficient MDS Array Codes for RAID Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures
From MaRDI portal
Publication:3417032
DOI10.1109/TC.2005.150zbMath1344.94101OpenAlexW2155828589MaRDI QIDQ3417032
No author found.
Publication date: 9 January 2007
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2005.150
Related Items (3)
On encoding symbol degrees of array BP-XOR codes ⋮ Zigzag decodable codes: linear-time erasure codes with applications to data storage ⋮ Maximum Distance Separable Codes Based on Circulant Cauchy Matrices
This page was built for publication: New Efficient MDS Array Codes for RAID Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures