Name
Abstract | ||
|---|---|---|
Locally repairable codes (LRCs) have received significant recent attention as a method of designing data storage systems robust to server failure. Optimal LRCs oer the ideal trade-o between minimum distance and locality, a measure of the cost of repairing a single codeword symbol. For optimal LRCs with minimum distance greater than or equal to 5, block length is bounded by a polynomial function of alphabet size. In this paper, we give explicit constructions of optimal-length (in terms of alphabet size), optimal LRCs with minimum distance equal to 5. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/allerton.2018.8636018 | 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) |
Keywords | DocType | Volume |
Government,Distributed databases,Upper bound,Reed-Solomon codes,Hamming weight,Data storage systems | Conference | abs/1810.03980 |
ISSN | Citations | PageRank |
2474-0195 | 2 | 0.36 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Allison Beemer | 1 | 2 | 0.36 |
| Ryan Coatney | 2 | 2 | 0.36 |
| V. Guruswami | 3 | 3205 | 247.96 |
| Hiram H. López | 4 | 20 | 4.81 |
| Fernando Piñero | 5 | 2 | 0.36 |