Constructing MSR codes with subpacketization 2<sup>n/3</sup> for k + 1 helper nodes
Constructing MSR codes with subpacketization 2<sup>n/3</sup> 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 parity nodes and subpacketization 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k/3</sup> . The number of helper nodes for this code is …