Erasure codes are being extensively deployed in distributed storage systems instead of
replication to achieve fault tolerance in a storage efficient manner. While traditional erasure …

Exact-repair regenerating codes are considered for the case (n, k, d)=(4, 3, 3), for which a
complete characterization of the rate region is provided. This characterization answers in the …

A new class of exact-repair regenerating codes is constructed by stitching together shorter
erasure correction codes, where the stitching pattern can be viewed as block designs. The …

Distributed storage systems employ codes to provide resilience to failure of multiple storage
disks. In particular, an (n, k) maximum distance separable (MDS) code stores k symbols in n …

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 …

While the tradeoff between the amount of data stored and the repair bandwidth of an (n, k, d)
regenerating code has been characterized under functional repair (FR), the case of exact …

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 …

This paper provides a link between matroid theory and locally repairable codes (LRCs) that
are either linear or more generally almost affine. Using this link, new results on both LRCs …

New codes and inner bounds for exact repair in distributed storage systems Page 1 New
Codes and Inner Bounds for Exact Repair in Distributed Storage Systems Sreechakra Goparaju …

Regenerating codes represent a class of block codes applicable for distributed storage
systems. The [n, k, d] regenerating code has data recovery capability while possessing …