Abstract-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]-(α) MSR code C over F q stores a file F consisting of αk symbols over F q among n nodes, each storing α symbols, in such a way that: 1) the file F can be recovered by downloading the content of any k of the n nodes and 2) the content of any failed node can be reconstructed by accessing any d of the remaining n − 1 nodes and downloading α/(d−k+1) symbols from each of these nodes. In practice, the file 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.
In REF , Goparaju et al. presented a construction of MSR codes for optimal repair of the systematic nodes for any number of accessed nodes d ∈ {k+1, . . . , n−1}. The reduced locality comes at the cost of increased subpacketization level.
Minimum Storage Regenerating Codes for All Parameters
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Computer Science