IEEE Transactions on Computers
Matrix methods for lost data reconstruction in erasure codes
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
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
Modified Low-Density MDS Array Codes for Tolerating Double Disk Failures in Disk Arrays
IEEE Transactions on Computers
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
A performance evaluation and examination of open-source erasure coding libraries for storage
FAST '09 Proccedings of the 7th conference on File and storage technologies
P-Code: a new RAID-6 code with optimal properties
Proceedings of the 23rd international conference on Supercomputing
International Journal of High Performance Computing Applications
Higher reliability redundant disk arrays: Organization, operation, and coding
ACM Transactions on Storage (TOS)
Shortening array codes and the perfect 1-factorization conjecture
IEEE Transactions on Information Theory
Cyclic lowest density MDS array codes
IEEE Transactions on Information Theory
T-code: 3-erasure longest lowest-density MDS codes
IEEE Journal on Selected Areas in Communications
ACM Transactions on Storage (TOS)
In search of I/O-optimal recovery from disk failures
HotStorage'11 Proceedings of the 3rd USENIX conference on Hot topics in storage and file systems
Rethinking erasure codes for cloud file systems: minimizing I/O for recovery and degraded reads
FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies
Generalized X-code: An efficient RAID-6 code for arbitrary size of disk array
ACM Transactions on Storage (TOS)
ACM Transactions on Storage (TOS)
What can coding theory do for storage systems?
ACM SIGACT News
Sector-Disk (SD) Erasure Codes for Mixed Failure Modes in RAID Systems
ACM Transactions on Storage (TOS)
SD codes: erasure codes designed for how storage systems really fail
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
Screaming fast Galois field arithmetic using intel SIMD instructions
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
| Hi-index | 754.96 |
Let Fq denote the finite field GF(q) and let h be a positive integer. MDS (maximum distance separable) codes over the symbol alphabet Fqb are considered that are linear over F q and have sparse (“low-density”) parity-check and generator matrices over Fq that are systematic over Fqb. Lower bounds are presented on the number of nonzero elements in any systematic parity-check or generator matrix of an Fq-linear MDS code over Fqb, along with upper bounds on the length of any MDS code that attains those lower bounds. A construction is presented that achieves those bounds for certain redundancy values. The building block of the construction is a set of sparse nonsingular matrices over Fq whose pairwise differences are also nonsingular. Bounds and constructions are presented also for the case where the systematic condition on the parity-check and generator matrices is relaxed to be over Fq, rather than over Fqb