Constructing MSR Codes With Subpacketization 2<sup> <i>n</i>/3</sup> for <i>k</i> + 1 Helper Nodes
Constructing MSR Codes With Subpacketization 2<sup> <i>n</i>/3</sup> for <i>k</i> + 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^{k/3}$. The number of helper nodes for this code is $d=k+1=n-1$, and this code has the smallest subpacketization among …