Optimal locally repairable codes and connections to matroid theory

Itzhak Tamo, Dimitris S. Papailiopoulos, Alexandros G. Dimakis

Research output: Contribution to journalArticlepeer-review


Petabyte-scale distributed storage systems are currently transitioning to erasure codes to achieve higher storage efficiency. Classical codes, such as Reed-Solomon (RS), are highly sub-optimal for distributed environments due to their high overhead during single-failure events. Locally repairable codes (LRCs) form a new family of codes that are repair efficient. In particular, LRCs minimize the number of nodes participating in single node repairs. Fundamental bounds and methods for explicitly constructing LRCs suitable for deployment in distributed storage clusters are not fully understood and currently form an active area of research. In this paper, we present an explicit LRC that is simple to construct and is optimal for a specific set of coding parameters. Our construction is based on grouping RS symbols and then adding extra simple parities that allow for small repair locality. For the analysis of the optimality of the code, we derive a new result on the matroid represented by the code's generator matrix.

Original languageEnglish
Article number7456275
Pages (from-to)6661-6671
Number of pages11
JournalIEEE Transactions on Information Theory
Issue number12
StatePublished - Dec 2016
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Optimal locally repairable codes and connections to matroid theory'. Together they form a unique fingerprint.

Cite this