EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures
IEEE Transactions on Computers - Special issue on fault-tolerant computing
A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems
Software—Practice & Experience
Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
Mathematical Programming: Series A and B
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Note: Correction to the 1997 tutorial on Reed–Solomon coding
Software—Practice & Experience - Research Articles
Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Network Storage Applications
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
STAR: an efficient coding scheme for correcting triple storage node failures
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
WEAVER codes: highly fault tolerant erasure codes for storage systems
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Using linear programming to Decode Binary linear codes
IEEE Transactions on Information Theory
Analysis for REPERA: A Hybrid Data Protection Mechanism in Distributed Environment
International Journal of Cloud Applications and Computing
Hi-index | 0.00 |
The computational costs of Cauchy Reed-Solomon (CRS) encoding operation make a great impact on the performance of its practical applications. The letter concentrates on how to construct a good Cauchy matrix which can lead to an efficient CRS coding scheme. We first formally model the problem by using a binary quadratic programming, then present an approximate method called localized greedy algorithm (LGA) to solve it. Compared with existing work, LGA requires much lower complexities to obtain the same performance of Cauchy matrices.