In a distributed storage system, code symbols are dispersed across space in nodes or
storage units as opposed to time. In settings such as that of a large data center, an important …

Twisted generalized Reed-Solomon (TGRS) codes are a family of codes that contains a
large number of maximum distance separable (MDS) codes that are non-equivalent to …

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 …

Two widely studied models of multiple-node repair in distributed storage systems are
centralized repair and cooperative repair. The centralized model assumes that all the failed …

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 …

The traditional means of ensuring reliability in data storage is to store multiple copies of the
same file in different storage units. Such a replication strategy is clearly inefficient in terms of …

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 …

In distributed storage, cooperative repair is to simultaneously recover h (h> 1) node erasures
by downloading data from surviving nodes as well as collaboration between the h …

Erasure codes are essential for providing efficient resilience against node failures in
distributed storage. Typically, an erasure code encodes symbols into symbols which are …

Maximum distance separable (MDS) codes are optimal in the sense that the minimum
distance cannot be improved for a given length and code size. Twisted Reed–Solomon …