Small-d MSR codes with optimal access, optimal sub-packetization and linear field size
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 …
regenerating (MSR) codes, for small values of the number $ d $ of helper nodes. The …
Small-d MSR Codes With Optimal Access, Optimal Sub-Packetization, and Linear Field Size
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 …
regenerating (MSR) codes, for small values of the number of helper nodes. The construction …
Constructions of high-rate MSR codes over small fields
A novel technique for construction of minimum storage regenerating (MSR) codes is
presented. Based on this technique, three explicit constructions of MSR codes are given …
presented. Based on this technique, three explicit constructions of MSR codes are given …
Constructing MSR codes with subpacketization 2n/3 for k + 1 helper nodes
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 …
explicit construction of an (n= k+ 2, k) Minimum Storage Regenerating (MSR) code with 2 …
Explicit constructions of high-rate MSR codes with optimal access property over small finite fields
Up to now, many (k+ r, k, N) minimum-storage regenerating (MSR) codes with k information
nodes, r parity nodes, and node capacity N have been proposed. However, most of them are …
nodes, r parity nodes, and node capacity N have been proposed. However, most of them are …
Constructing MSR Codes With Subpacketization 2n/3 for k + 1 Helper Nodes
Wang et al.(IEEE Transactions on Information Theory, vol. 62, no. 8, 2016) proposed an
explicit construction of an Minimum Storage Regenerating (MSR) code with 2 parity nodes …
explicit construction of an Minimum Storage Regenerating (MSR) code with 2 parity nodes …
Constructions of high-rate minimum storage regenerating codes over small fields
A novel technique for construction of minimum storage regenerating (MSR) codes is
presented. Based on this technique, three explicit constructions of MSR codes are given …
presented. Based on this technique, three explicit constructions of MSR codes are given …
MSR codes with linear field size and smallest sub-packetization for any number of helper nodes
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 …
is a vector in for some finite field. An MDS array code has the additional property that any k …
An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and d<(n− 1)
B Sasidharan, M Vajha… - 2017 IEEE International …, 2017 - ieeexplore.ieee.org
This paper presents an explicit construction for an ((n= 2qt, k= 2q {t-1), d= n-(q+ 1)),(α= q
(2q) t-1, β= α/q)) regenerating code over a field F q operating at the Minimum Storage …
(2q) t-1, β= α/q)) regenerating code over a field F q operating at the Minimum Storage …
On lower bounds on sub-packetization level of MSR codes and on the structure of optimal-access MSR codes achieving the bound
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 …
parameters $(n, k, d= n-1,\alpha) $ where $ n $ is the block length, $ k $ dimension, $ d …