@inproceedings{5cfc0fe5e97d445088d48523695420da,
title = "Progress on high-rate MSR codes: Enabling arbitrary number of helper nodes",
abstract = "This paper presents a construction for high-rate MDS codes that enable bandwidth-efficient repair of a single node. Such MDS codes are also referred to as the minimum storage regenerating (MSR) codes in the distributed storage literature. The construction presented in this paper generates MSR codes for all possible number of helper nodes d as d is a design parameter in the construction. Furthermore, the obtained MSR codes have polynomial sub-packetization (a.k.a. node size) α. The construction is built on the recent code proposed by Sasidharan et al. [1], which works only for d = n - 1, i.e., where all the remaining nodes serve as the helper nodes for the bandwidth-efficient repair of a single node. The results of this paper broaden the set of parameters where the constructions of MSR codes were known earlier.",
keywords = "Codes for distributed storage, minimum storage regenerating (MSR) codes, regenerating codes, sub-packetization",
author = "Rawat, \{Ankit Singh\} and Koyluoglu, \{O. Ozan\} and Sriram Vishwanath",
note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 Information Theory and Applications Workshop, ITA 2016 ; Conference date: 31-01-2016 Through 05-02-2016",
year = "2017",
month = mar,
day = "27",
doi = "10.1109/ITA.2016.7888191",
language = "English (US)",
series = "2016 Information Theory and Applications Workshop, ITA 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2016 Information Theory and Applications Workshop, ITA 2016",
}