Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures
Abstract
Recently, locally repairable codes has gained significant interest for their potential applications in distributed storage systems. However, most constructions in existence are over fields with size that grows with the number of servers, which makes the systems computationally expensive and difficult to maintain. Here, we study linear locally repairable codes over the binary field, tolerating multiple local erasures. We derive bounds on the minimum distance on such codes, and give examples of LRCs achieving these bounds. Our main technical tools come from matroid theory, and as a byproduct of our proofs, we show that the lattice of cyclic flats of a simple binary matroid is atomic.
Cite
@article{arxiv.1709.05801,
title = {Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures},
author = {Matthias Grezet and Ragnar Freij-Hollanti and Thomas Westerbäck and Oktay Olmez and Camilla Hollanti},
journal= {arXiv preprint arXiv:1709.05801},
year = {2018}
}
Comments
9 pages, 1 figure. Parts of this paper were presented at IZS 2018. This extended arxiv version includes corrected versions of Theorem 1.4 and Proposition 6 that appeared in the IZS 2018 proceedings