Explicit optimal-length locally repairable codes of distance 5
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2018
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909094528417792 |
|---|---|
| author | Beemer, Allison Coatney, Ryan Guruswami, Venkatesan López, Hiram H. Piñero, Fernando |
| author_facet | Beemer, Allison Coatney, Ryan Guruswami, Venkatesan López, Hiram H. Piñero, Fernando |
| contents | Locally repairable codes (LRCs) have received significant recent attention as a method of designing data storage systems robust to server failure. Optimal LRCs offer the ideal trade-off 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1810_03980 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Explicit optimal-length locally repairable codes of distance 5 Beemer, Allison Coatney, Ryan Guruswami, Venkatesan López, Hiram H. Piñero, Fernando Information Theory Computational Complexity Commutative Algebra Locally repairable codes (LRCs) have received significant recent attention as a method of designing data storage systems robust to server failure. Optimal LRCs offer the ideal trade-off 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. |
| title | Explicit optimal-length locally repairable codes of distance 5 |
| topic | Information Theory Computational Complexity Commutative Algebra |
| url | https://arxiv.org/abs/1810.03980 |