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 …

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 …

For general exact repair regenerating codes, the optimal trade-offs between the storage size
and repair bandwidth remain undetermined. Various outer bounds and partial results have …

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 …

The growing privacy concerns and the communication costs associated with transmitting raw
data have resulted in techniques like federated learning, where the machine learning …

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 study the problem of centralized exact repair of multiple failures in distributed storage.
We describe constructions that achieve a new set of interior points under exact repair. The …

The study of the fundamental limits of information systems is a central theme in information
theory. Both the traditional analytical approach and the recently proposed computational …

Proving linear inequalities and identities of Shannon's information measures, possibly with
linear constraints on the information measures, is an important problem in information …