Abstract
Erasure-correcting codes, which support local repair of codeword symbols, have attracted substantial attention recently for their application in distributed storage systems. This paper investigates a generalization of the usual locally repairable codes. In particular, this paper studies a class of codes with the following property: any small set of codeword symbols can be reconstructed (repaired) from a small number of other symbols. This is referred to as cooperative local repair. The main contribution of this paper is bounds on the trade-off of the minimum distance and the dimension of such codes, as well as explicit constructions of families of codes that enable cooperative local repair. Some other results regarding cooperative local repair are also presented, including an analysis for the well-known Hadamard/Simplex codes.
| Original language | English (US) |
|---|---|
| Article number | 107 |
| Pages (from-to) | 1-17 |
| Number of pages | 17 |
| Journal | Eurasip Journal on Advances in Signal Processing |
| Volume | 2015 |
| Issue number | 1 |
| DOIs | |
| State | Published - Dec 1 2015 |
| Externally published | Yes |
Bibliographical note
Funding Information:A. Mazumdar’s research in this paper is supported by NSF CAREER grant CCF 1453121 and grant CCF1318093. S. Vishwanath would like to acknowledge support from Army Research Office under grant W911NF1110258. A part of this paper was presented at the 48th Annual Conference on Information Sciences and Systems on March 2014.
Publisher Copyright:
© 2015, Rawat et al.
Keywords
- Codes on graphs
- Coding for distributed storage
- Cooperative repair
- Locally repairable codes