A Systematic Construction of MDS Codes With Small Sub-packetization Level and Near-Optimal Repair Bandwidth
arXiv:1901.08254 · doi:10.1109/TIT.2020.3036386
Abstract
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 transformation that can greatly reduce the sub-packetization level of MDS codes with the optimal repair bandwidth 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 three of them are explicit and the required field sizes are around or even smaller than the code length n. Additionally, we propose another explicit MDS code which has a similar structure as that of the first resultant code obtained by the generic transformation, but can be built on a smaller finite field.
arXiv commentAccepted for publication in the IEEE Transactions on Information Theory
References in corpus (5)
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Zigzag Codes: MDS Array Codes with Optimal Rebuilding
- A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems
- A Framework of Constructions of Minimal Storage Regenerating Codes with the Optimal Access/Update Property
- Cascade Codes For Distributed Storage Systems