Minimum Storage Regenerating Codes for All Parameters.

Regenerating codes for distributed storage have attracted much research interest in the past decade. Such codes trade the bandwidth needed to repair a failed node with the overall amount of data stored in the network. Minimum storage regenerating (MSR) codes are an important class of optimal regenerating codes that minimize (first) the amount of data stored per node and (then) the repair bandwidth. Specifically, an [n,k,d] - (\alpha ) MSR code \mathbb C over \smash \mathbb F\!q stores a file \mathcal F consisting of \alpha k symbols over \smash {\mathbb {F}_{\!q}} among n$ nodes, each storing \alpha $ symbols, in such a way that: 1) the file k$ of the n$ nodes and 2) the content of any failed node can be reconstructed by accessing any d$ of the remaining symbols from each of these nodes. In practice, the file \mathcal F is typically available in uncoded form on some $k$ of the $n$ nodes, known as systematic nodes, and the defining node-repair condition above can be relaxed to requiring the optimal repair bandwidth for systematic nodes only. Such codes are called systematic–repair MSR codes. Unfortunately, finite– $\alpha $ constructions of $[n,k,d]$ MSR codes are known only for certain special cases: either low rate, namely $k/n \leqslant 0.5$ , or high repair connectivity, namely $d = n-1$ . Our main result in this paper is a finite– $\alpha $ construction of systematic-repair $[n,k,d]$ MSR codes for all possible values of parameters $n,k,d$ . We also introduce a generalized construction for $[n,k]$ MSR codes to achieve the optimal repair bandwidth for all values of $d$ simultaneously. [ABSTRACT FROM PUBLISHER]