TY - GEN
T1 - Optimal locally repairable codes via rank-metric codes
AU - Silberstein, Natalia
AU - Rawat, Ankit Singh
AU - Koyluoglu, O. Ozan
AU - Vishwanath, Sriram
PY - 2013
Y1 - 2013
N2 - This paper presents a new explicit construction for locally repairable codes (LRCs) for distributed storage systems which possess all-symbol locality and the largest possible minimum distance, or equivalently, can tolerate the maximum number of node failures. This construction, based on maximum rank distance (MRD) Gabidulin codes, provides new optimal vector and scalar LRCs. In addition, the paper also discusses mechanisms by which codes obtained using this construction can be used to construct LRCs with efficient local repair of failed nodes by combination of LRCs with regenerating codes.
AB - This paper presents a new explicit construction for locally repairable codes (LRCs) for distributed storage systems which possess all-symbol locality and the largest possible minimum distance, or equivalently, can tolerate the maximum number of node failures. This construction, based on maximum rank distance (MRD) Gabidulin codes, provides new optimal vector and scalar LRCs. In addition, the paper also discusses mechanisms by which codes obtained using this construction can be used to construct LRCs with efficient local repair of failed nodes by combination of LRCs with regenerating codes.
UR - http://www.scopus.com/inward/record.url?scp=84890327637&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84890327637&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2013.6620541
DO - 10.1109/ISIT.2013.6620541
M3 - Conference contribution
AN - SCOPUS:84890327637
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1819
EP - 1823
BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -