Explicit optimal-length locally repairable codes of distance 5
From MaRDI portal
Publication:6503391
DOI10.1109/ALLERTON.2018.8636018arXiv1810.03980MaRDI QIDQ6503391FDOQ6503391
Authors: Allison Beemer, Ryan Coatney, Venkatesan Guruswami, Hiram H. López, Fernando L. Piñero 
Abstract: 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.
This page was built for publication: Explicit optimal-length locally repairable codes of distance 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6503391)
