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 …

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 …

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 …

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 …

Recently, some high-rate maximum distance separable (MDS) array codes were designed
to optimally repair a single failed node by connecting all the surviving nodes. However, in …

We present two lower bounds on sub-packetization level of MSR codes with parameters
where is the block length, is the number of helper nodes contacted during single-node …

In the literature, most of the known high-rate $(n, k) $ MDS array codes with the optimal
repair property only support a single repair degree (ie, the number of helper nodes …

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

Storage codes are used to ensure reliable storage of data in distributed systems; functional
repair codes have the additional property that individual storage nodes that fail may be …

We study the problem of centralized exact repair of multiple failures in distributed storage.
We present constructions that achieve a new set of interior points under exact repair. The …