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 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 …

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 …

Centralized repair refers to repairing $ h\geq 2$ node failures using $ d $ helper nodes in a
centralized way, where the repair bandwidth is counted by the total amount of data …

Wang et al.(IEEE Transactions on Information Theory, vol. 62, no. 8, 2016) proposed an
explicit construction of an (n= k+ 2, k) Minimum Storage Regenerating (MSR) code with 2 …

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 $ d $ of helper nodes. The …

Minimum storage regenerating (MSR) codes form a special class of maximum distance
separable (MDS) codes by providing mechanisms for exact regeneration of a single code …

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 …

Minimum storage regenerating (MSR) codes, with the MDS property and the optimal repair
bandwidth, are widely used in distributed storage systems (DSS) for data recovery. In this …