The repair problem for an (n, k) error-correcting code calls for recovery of an unavailable
coordinate of the codeword by downloading as little information as possible from a subset of …

The problem of repairing linear codes and, in particular, Reed Solomon (RS) codes has
attracted a lot of attention in recent years due to their extreme importance to distributed …

The repair problem in distributed storage addresses recovery of the data encoded using an
erasure code, for instance, a Reed-Solomon (RS) code. We consider the problem of …

Reed-Solomon codes have found many applications in practical storage systems, but were
until recently considered unsuitable for distributed storage applications due to the widely …

We consider (n, k, l) MDS codes of length n, dimension k, and subpacketization l over a finite
field F. A codeword of such a code consists of n column-vectors of length l over F, with the …

We consider exact repair of failed nodes in maximum distance separable (MDS) code based
distributed storage systems. It is well known that an (n, k) MDS code can tolerate failure …

Reed-Solomon (RS) codes are widely used in distributed storage systems. In this paper, we
study the repair bandwidth and sub-packetization size of RS codes. The repair bandwidth is …

A fundamental fact about polynomial interpolation is that k evaluations of a degree-(k-1)
polynomial f are sufficient to determine f. This is also necessary in a strong sense: given k-1 …

Recently Reed-Solomon (RS) codes were shown to possess a repair scheme that supports
repair of failed nodes with optimal repair bandwidth. In this paper, we extend this result in …

In distributed storage, erasure codes (like Reed-Solomon Codes) are often employed to
provide reliability. In this setting, it is desirable to be able to repair one or more failed nodes …