Binary cyclic codes that are locally repairable
Authors:
- 1 June 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 676-680
Abstract
Codes for storage systems aim to minimize the repair locality, which is the number of disks (or nodes) that participate in the repair of a single failed disk. Simultaneously, the code must sustain a high rate, operate on a small finite field to be practically significant and be tolerant to a large number of erasures. To this end, we construct new families of binary linear codes that have an optimal dimension (rate) for a given minimum distance and locality. Specifically, we construct cyclic codes that are locally repairable for locality 2 and distances 2, 6 and 10. In doing so, we discover new upper bounds on the code dimension, and prove the optimality of enabling local repair by provisioning disjoint groups of disks. Finally, we extend our construction to build codes that have multiple repair sets for each disk.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Optimal locally repairable codes via rank-metric codes2013
- Optimal locally repairable codes and connections to matroid theory2013
- Locally repairable codes with multiple repair alternatives2013
- An upper bound on the size of locally recoverable codes2013
- XORing elephantsProceedings of the VLDB Endowment, 2013
- Locally repairable codes2012
- Optimal linear codes with a local-error-correction property2012
- On codes for optimal rebuilding access2011
- Repair optimal erasure codes through hadamard designs2011
- Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems2007