Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures

Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Oktay Olmez, Camilla Hollanti

Research output: Chapter in Book/Report/Conference proceedingConference contributionProfessional

47 Downloads (Pure)

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 languageEnglish
Title of host publicationThe International Zurich Seminar on Information and Communication (IZS 2018) Proceedings
EditorsAmos Lapidoth, Stefan M. Moser
PublisherETH Zürich
Pages103-107
DOIs
Publication statusPublished - 21 Feb 2018
MoE publication typeD3 Professional conference proceedings
EventInternational Zurich Seminar on Information and Communication - Zurich, Switzerland
Duration: 21 Feb 201823 Feb 2018

Seminar

SeminarInternational Zurich Seminar on Information and Communication
CountrySwitzerland
CityZurich
Period21/02/201823/02/2018

Fingerprint Dive into the research topics of 'Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures'. Together they form a unique fingerprint.

Cite this