Name
Abstract | ||
|---|---|---|
We construct rank-metric codes with locality constraints under the rank-metric. Our motivation stems from designing codes for efficient data recovery from correlated and/or mixed (i.e., complete and partial) failures in distributed storage systems. Specifically, the proposed local rank-metric codes can recover locally from crisscross failures, which affect a limited number of rows and/or columns of the storage system. First, we prove a Singleton-like upper bound on the minimum rank-distance of linear codes with rank-locality constraints. Second, we construct a family of locally recoverable rank-metric codes that achieve this bound for a broad range of parameters. The proposed construction builds upon Tamo and Barg's method for constructing locally repairable codes with optimal minimum Hamming distance. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/ALLERTON.2016.7852348 | 2016 54TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON) |
DocType | Volume | ISSN |
Journal | abs/1707.05944 | 2474-0195 |
Citations | PageRank | References |
2 | 0.37 | 45 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Swanand Kadhe | 1 | 54 | 11.22 |
| Salim Y. El Rouayheb | 2 | 188 | 18.00 |
| Iwan M. Duursma | 3 | 279 | 26.85 |
| Alex Sprintson | 4 | 279 | 35.35 |