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 …

Despite their exceptional error-correcting properties, Reed-Solomon (RS) codes have been
overlooked in distributed storage applications due to the common belief that they have poor …

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 …

We propose new repair schemes for Reed-Solomon codes that use subspace polynomials
and hence generalize previous works in the literature that employ trace polynomials. The …

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 …

The issue of repairing Reed-Solomon codes currently employed in industry has been
sporadically discussed in the literature. In this work we carry out a systematic study of these …

Despite their exceptional error-correcting properties, Reed-Solomon (RS) codes have been
overlooked in distributed storage applications due to the common belief that they have poor …

Reed-Solomon (RS) codes are widely used in practical storage systems but their repair
bandwidth characterization is still an open problem. RS codes can be viewed as the …

Network transfer and disk read constitute the two most time-consuming operations in the
repair process for node failures in erasure-code-based distributed storage systems. Recent …

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 …