Ningning Wang

most citedMSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes

16 citations · 30 across the 2 of their papers we have counts for

collaborators

Showing cs.ITShow all

2 papers · 1 filter

cs.IT2023★ 16 cited

MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes

Guodong Li, Ningning Wang, Sihuang Hu +1

The sub-packetization $ℓ$ and the field size $q$ are of paramount importance in the MSR array code constructions. For optimal-access MSR codes, Balaji et al. proved that $\ell\g…

cs.IT2022★ 14 cited

Constructing MSR codes with subpacketization $2^{n /3}$ for $k + 1$ helper nodes

Ningning Wang, Guodong Li, Sihuang Hu +1

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

MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes

Constructing MSR codes with subpacketization 2n/3 for k+1 helper nodes

Constructing MSR codes with subpacketization $2^{n /3}$ for $k + 1$ helper nodes