In the literature, all the known high-rate MDS codes with the optimal repair bandwidth
possess a significantly large sub-packetization level, which may prevent the codes to be …

An (n, k, l) MDS code of length n, dimension k, and sub-packetization l over a finite field F is
a set of n column vectors of length l over F with the property that any k vectors can recover …

This paper addresses the problem of constructing maximum distance separable (MDS)
codes that enable exact reconstruction (repair) of each code block by downloading a small …

We consider (n, k, l) MDS codes of length n, dimension k, and subpacketization l over a finite
field F. A codeword of such a code consists of n column-vectors of length l over F, with the …

We propose a generic transformation on maximum distance separable (MDS) codes, which
can convert any non-binary (k+ r, k) MDS code into another (k+ r, k) MDS code with the …

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 …

Abundant high-rate minimum storage regenerating (MSR) codes have been reported in the
literature. However, most of them require contacting all the surviving nodes during a node …

The first focus of the present paper, is on lower bounds on the sub-packetization level α of
an MSR code that is capable of carrying out repair in help-by-transfer fashion (also called …

An (n, k, l) maximum distance separable (MDS) array code of length n, dimension k= nr, and
subpacketization l is formed of l× n matrices over a finite field F, with every column of the …

An (n, k) maximum distance separable (MDS) code encodes kα data symbols into nα
symbols that are stored in n nodes with α symbols each, such that the kα data symbols can …