4 research outputs found
New Centralized MSR Codes With Small Sub-packetization
Centralized repair refers to repairing node failures using
helper nodes in a centralized way, where the repair bandwidth is counted by the
total amount of data downloaded from the helper nodes. A centralized MSR code
is an MDS array code with -optimal repair for some and . In this
paper, we present several classes of centralized MSR codes with small
sub-packetization. At first, we construct an alternative MSR code with
-optimal repair for multiple repair degrees simultaneously.
Based on the code structure, we are able to construct a centralized MSR code
with -optimal repair property for all possible with
simultaneously. The sub-packetization is no more than , which is much smaller than a previous work given
by Ye and Barg (). Moreover, for general
parameters and , we further give a
centralized MSR code enabling -optimal repair with sub-packetization
smaller than all previous works
Systematic Construction of MDS Codes with Small Sub-packetization Level and Near Optimal Repair Bandwidth
In the literature, all the known high-rate MDS codes with the optimal repair bandwidth possess a significantly large sub-packetization level, which may prevent the codes to be implemented in practical systems. To build MDS codes with small sub-packetization level, existing constructions and theoretical bounds imply that one may sacrifice the optimality of the repair bandwidth. Partly motivated by the work of Tamo et al. (IEEE Trans. Inform. Theory, 59(3), 1597-1616, 2013), in this paper, we present a powerful transformation that can greatly reduce the sub-packetization level of any MDS codes with respect to the same code length n. As applications of the transformation, four high-rate MDS codes having both small sub-packetization level and near optimal repair bandwidth can be obtained, where two of them are also explicit and the required field sizes are comparable to the code length n.Peer reviewe