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 for distributed storage have attracted much research interest in the past
decade. Such codes trade the bandwidth needed to repair a failed node with the overall …

In distributed storage, a file is stored in a set of nodes and protected by erasure-correcting
codes. Regenerating code is a type of code with two properties: first, it can reconstruct the …

Minimum-Storage Regenerating (MSR) codes have emerged as a viable alternative to Reed-
Solomon (RS) codes as they minimize the repair bandwidth while they are still optimal in …

We present a high-rate (n, k, d= n− 1)-MSR code with a sub-packetization level that is
polynomial in the dimension k of the code. While polynomial sub-packetization level was …

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 technique for construction of minimum storage regenerating (MSR) codes is
presented. Based on this technique, three explicit constructions of MSR codes are given …

This paper presents an explicit construction of a class of optimal-access, minimum storage
regenerating (MSR) codes, for small values of the number of helper nodes. The construction …

Erasure coding provides high fault-tolerant storage with significantly low redundancy
overhead, at the expense of high repair bandwidth. While there exist access-optimal codes …

Maximum distance separable (MDS) array codes are widely used in storage systems due to
their computationally efficient encoding and decoding procedures. An MDS code with r …