Regenerating codes are a class of recently developed codes for distributed storage that, like
Reed-Solomon codes, permit data recovery from any subset of nodes within the-node …

We introduce a new class of exact Minimum-Bandwidth Regenerating (MBR) codes for
distributed storage systems, characterized by a low-complexity uncoded repair process that …

The high repair cost of (n,k) Maximum Distance Separable (MDS) erasure codes has
recently motivated a new class of MDS codes, called Repair MDS codes, that can …

Regenerating codes are a class of codes for distributed storage networks that provide
reliability and availability of data, and also perform efficient node repair. Another important …

The high repair cost of (n, k) Maximum Distance Separable (MDS) erasure codes has
recently motivated a new class of codes, called Regenerating Codes, that optimally trade off …

We consider the problem of minimizing the bandwidth required to repair a failed node when
data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the …

The capacity of heterogeneous distributed storage systems under repair dynamics is
studied. Examples of these systems include peer-to-peer storage clouds, wireless, and …

The problem of securing data against eavesdropping in distributed storage systems is
studied. The focus is on systems that use linear codes and implement exact repair to recover …

We focus on the problem of secure distributed storage over multiple untrusted clouds or
networks. Our main contribution is a low complexity scheme that relies on erasure coding …

Network coding-based storage has recently received a lot of attention in the network coding
community. Independently, another body of work has proposed integrity checking schemes …