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 …

We present two lower bounds on sub-packetization level $\alpha $ of MSR codes with
parameters $(n, k, d= n-1,\alpha) $ where $ n $ is the block length, $ k $ dimension, $ d …

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 …

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 …

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 …

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 …

The repair problem for an (n, k) error-correcting code calls for recovery of an unavailable
coordinate of the codeword by downloading as little information as possible from a subset of …

An $(n, k) $ maximum distance separable (MDS) code has optimal repair access if the
minimum number of symbols accessed from $ d $ surviving nodes is achieved, where $ k+ …

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 …