A connection between locally repairable codes and exact regenerating codes
Loading...
Access rights
openAccess
Journal Title
Journal ISSN
Volume Title
Conference article in proceedings
This publication is imported from Aalto University research portal.
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
Date
2016-08-10
Major/Subject
Mcode
Degree programme
Language
en
Pages
5
650-654
650-654
Series
Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory, Volume 2016-August, IEEE International Symposium on Information Theory
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.Description
Keywords
Other note
Citation
Ernvall , T , Westerbäck , T , Freij-Hollanti , R & Hollanti , C 2016 , A connection between locally repairable codes and exact regenerating codes . in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory . vol. 2016-August , 7541379 , IEEE International Symposium on Information Theory , IEEE , pp. 650-654 , IEEE International Symposium on Information Theory , Barcelona , Spain , 10/07/2016 . https://doi.org/10.1109/ISIT.2016.7541379
