A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A connection between locally repairable codes and exact regenerating codes
2016
2016 IEEE International Symposium on Information Theory (ISIT)
Preserved Fulltext
Other Versions
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
doi:10.1109/isit.2016.7541379
dblp:conf/isit/ErnvallWFH16
fatcat:wbxa3emvvzaadowgqjsl6y3p7u