A connection between locally repairable codes and exact regenerating codes

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

3 Citations (Scopus)
114 Downloads (Pure)

Abstract

Typically, locally repairable codes (LRCs) and regenerating codes have been studied independently of each other, and it has not been clear how the parameters of one relate to those of the other. In this paper, a novel connection between locally repairable codes and exact regenerating codes is established. Via this connection, locally repairable codes are interpreted as exact regenerating codes. Further, some of these codes are shown to perform better than time-sharing codes between minimum bandwidth regenerating and minimum storage regenerating codes.

Original languageEnglish
Title of host publicationProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PublisherIEEE
Pages650-654
Number of pages5
Volume2016-August
ISBN (Electronic)978-1-5090-1806-2
DOIs
Publication statusPublished - 10 Aug 2016
MoE publication typeA4 Article in a conference publication
EventIEEE International Symposium on Information Theory - Barcelona, Spain
Duration: 10 Jul 201615 Jul 2016
http://www.isit2016.org/

Publication series

NameIEEE International Symposium on Information Theory
PublisherIEEE
ISSN (Print)2157-8095
ISSN (Electronic)2157-8117

Conference

ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
CountrySpain
CityBarcelona
Period10/07/201615/07/2016
Internet address

Fingerprint Dive into the research topics of 'A connection between locally repairable codes and exact regenerating codes'. Together they form a unique fingerprint.

Cite this