Abstract
Recently, locally repairable codes have 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.
Original language | English |
---|---|
Title of host publication | The International Zurich Seminar on Information and Communication (IZS 2018) Proceedings |
Editors | Amos Lapidoth, Stefan M. Moser |
Publisher | ETH Zürich |
Pages | 103-107 |
DOIs | |
Publication status | Published - 21 Feb 2018 |
MoE publication type | D3 Professional conference proceedings |
Event | International Zurich Seminar on Information and Communication - Zurich, Switzerland Duration: 21 Feb 2018 → 23 Feb 2018 |
Seminar
Seminar | International Zurich Seminar on Information and Communication |
---|---|
Country/Territory | Switzerland |
City | Zurich |
Period | 21/02/2018 → 23/02/2018 |