Constructions and Properties of Linear Locally Repairable Codes

Toni Ernvall, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti

Research output: Contribution to journalArticleScientificpeer-review

20 Citations (Scopus)
128 Downloads (Pure)

Abstract

In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. It is also shown that, with high probability, a random matrix with a few extra columns guaranteeing the locality property is a generator matrix for a locally repairable code with a good minimum distance. The proof of the result provides a constructive method to find locally repairable codes. Finally, constructions of three infinite classes of optimal vector-linear locally repairable codes over a small alphabet independent of the code size are given.

Original languageEnglish
Pages (from-to)1129-1143
Number of pages15
JournalIEEE Transactions on Information Theory
Volume62
Issue number3
DOIs
Publication statusPublished - Mar 2016
MoE publication typeA1 Journal article-refereed

Keywords

  • Codes
  • data storage systems
  • DISTRIBUTED STORAGE-SYSTEMS
  • POINTS
  • MBR
  • MSR

Cite this