DocumentCode
640203
Title
Optimal locally repairable codes via rank-metric codes
Author
Silberstein, Natalia ; Rawat, A.S. ; Koyluoglu, O.O. ; Vishwanath, Sriram
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA
fYear
2013
fDate
7-12 July 2013
Firstpage
1819
Lastpage
1823
Abstract
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.
Keywords
codes; distributed databases; storage management; Gabidulin codes; MRD; all-symbol locality; distributed storage systems; maximum rank distance; node failures; optimal locally repairable codes; optimal vector; rank-metric codes; regenerating codes; scalar LRC; Arrays; Bandwidth; Encoding; Maintenance engineering; Spread spectrum communication; Upper bound; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location
Istanbul
ISSN
2157-8095
Type
conf
DOI
10.1109/ISIT.2013.6620541
Filename
6620541
Link To Document