DocumentCode :
650327
Title :
MDS codes with low repair complexity for distributed storage networks
Author :
Hongmei Xie ; Zhiyuan Yan
Author_Institution :
Dept. of Electr. & Comput. Eng., Lehigh Univ., Bethlehem, PA, USA
fYear :
2013
fDate :
16-18 May 2013
Firstpage :
384
Lastpage :
387
Abstract :
In this paper, we propose two new constructions of maximum distance separable (MDS) codes with low repair complexity for distributed storage networks. For both constructions, the encoded symbols are obtained by first treating the message vector as a linearized polynomial and then evaluating it at carefully chosen points. Compared to traditional MDS codes, data repair for our codes does not have to decode the entire original message, but only forms linear combinations of available encoded symbols. This linear repair complexity is attractive for applications with a large amount of data repair.
Keywords :
decoding; encoding; polynomials; storage area networks; MDS codes; available encoded symbols; distributed storage networks; linear combinations; linear repair complexity; linearized polynomial; low repair complexity; maximum distance separable codes; message vector; Distributed storage; MDS codes; repair complexity;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless and Optical Communication Conference (WOCC), 2013 22nd
Conference_Location :
Chongqing
Print_ISBN :
978-1-4673-5697-8
Type :
conf
DOI :
10.1109/WOCC.2013.6676397
Filename :
6676397
Link To Document :
بازگشت