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 …

Regenerating codes and codes with locality are two coding schemes that have recently
been proposed, which in addition to ensuring data collection and reliability, also enable …

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 …

In distributed storage systems, regenerating codes can achieve the optimal tradeoff between
storage capacity and repair bandwidth. However, a critical drawback of existing …

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 …

Repair operations in erasure-coded distributed storage systems involve a lot of data
movement. This can potentially expose data to malicious acts of passive eavesdroppers or …

Distributed storage systems (DSSs) in the presence of an external wiretapper are
considered. A DSS is parameterized by (n, k, d), in which the data are stored across n nodes …

In a distributed storage system, recovering from multiple failures is a critical and frequent
task that is crucial for maintaining the system's reliability and fault-tolerance. In this paper …

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 …