Codes in the sum-rank metric have attracted significant attention for their applications in
distributed storage systems, multishot network coding, streaming over erasure channels …

Erasure coding is a known redundancy technique that has been popularly deployed in
modern storage systems to protect against failures. By introducing a small portion of coded …

An array code has k information coordinates and parity coordinates, where each coordinate
is a vector in for some finite field. An MDS array code has the additional property that any k …

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 …

We study the problem of erasure correction (node repair) for regenerating codes defined on
graphs wherein the cost of transmitting the information to the failed node depends on the …

Locally recoverable codes (LRCs) with locality parameter $ r $ can recover any erased code
symbol by accessing $ r $ other code symbols. This local recovery property is of great …

We consider regenerating codes in distributed storage systems where connections between
the nodes are constrained by a graph. In this problem, the failed node downloads the …

Subspace codes are the $ q $-analog of binary block codes in the Hamming metric. Here the
codewords are vector spaces over a finite field. They have eg applications in random linear …

Node repair on graphs is a recent variation of the distributed storage model, where
connections between the storage nodes are described by a graph. Here we study this …

A collection of $ K $ random variables are called $(K, n) $-MDS if any $ n $ of the $ K $
variables are independent and determine all remaining variables. In the MDS variable …