EVENODD
From MaRDI portal
swMATH2377MaRDI QIDQ14917FDOQ14917
Author name not available (Why is that?)
Official website: http://paradise.caltech.edu/RAIN/evenodd.html
Cited In (21)
- On data reliability algorithms in storage systems
- Codes for Distributed Storage
- Methods for placing data and parity to tolerate two disk failures in disk arrays using complete bipartite graphs
- X-code: MDS array codes with optimal encoding
- Recovering erasures by using MDS codes over extension alphabets
- On encoding symbol degrees of array BP-XOR codes
- Title not available (Why is that?)
- A cost effective fault-tolerant scheme for RAIDs
- Maximum distance separable codes based on circulant Cauchy matrices
- Optimizing large data transfers in parity-declustered data layouts
- CEFT: a cost-effective, fault-tolerant parallel virtual file system
- Flexible usage of redundancy in disk arrays
- Zigzag decodable codes: linear-time erasure codes with applications to data storage
- Jerasure
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear programming bounds for distributed storage codes
- X-code double parity array operation with two disk failures
- Failed disk recovery in double erasure RAID arrays
- A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes
- Low-density MDS codes and factors of complete graphs
This page was built for software: EVENODD
