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 …

Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

This chapter provides a short survey of coding for distributed storage systems. It describes
the code design criteria for such codes, emphasizing what makes them different from …

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 …

A novel coding scheme for exact repair-regenerating codes is presented in this paper. The
codes proposed in this work can trade between the repair bandwidth of nodes (number of …

In this paper, we consider the setting of exact repair linear regenerating codes. Under this
setting, we derive a new outer bound on the storage-repair-bandwidth trade-off for the case …

Abstract An (n, k, d, α)(n, k, d, α)-MSR (minimum storage regeneration) code is a set of n
nodes used to store a file. For a file of total size k α k α, each node stores α α symbols, any k …

In this paper, three outer bounds on the normalised storage-repair bandwidth trade-off of
regenerating codes having parameter set {(n, k, d),(α, β)} under the exact-repair (ER) setting …

Exact-repair regenerating codes (ERRCs) are a class of codes designed for distributed
storage systems. A distributed storage system is a collection of devices that collaborate to …

We consider the use of regenerating codes in distributed storage systems where
connections between the nodes are constrained by a graph. In this setting the cost of node …