The following pages link to EVENODD (Q14917):
Displaying 20 items.
- Recovering erasures by using MDS codes over extension alphabets (Q258876) (← links)
- On encoding symbol degrees of array BP-XOR codes (Q267791) (← links)
- Failed disk recovery in double erasure RAID arrays (Q924549) (← links)
- A cost effective fault-tolerant scheme for RAIDs (Q1429437) (← links)
- Flexible usage of redundancy in disk arrays (Q1818093) (← links)
- X-code double parity array operation with two disk failures (Q1944951) (← links)
- Linear programming bounds for distributed storage codes (Q2176298) (← links)
- A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes (Q2194505) (← links)
- Optimizing large data transfers in parity-declustered data layouts (Q2256719) (← links)
- CEFT: a cost-effective, fault-tolerant parallel virtual file system (Q2369676) (← links)
- Zigzag decodable codes: linear-time erasure codes with applications to data storage (Q2402361) (← links)
- (Q2766522) (← links)
- Maximum Distance Separable Codes Based on Circulant Cauchy Matrices (Q2868656) (← links)
- (Q3429595) (← links)
- (Q3501573) (← links)
- (Q4429009) (← links)
- Low-density MDS codes and factors of complete graphs (Q4503388) (← links)
- (Q4677936) (← links)
- X-code: MDS array codes with optimal encoding (Q4701265) (← links)
- Codes for Distributed Storage (Q5863765) (← links)
