Technical Program

Paper Detail

Paper Title Systematic Construction of MDS Codes with Small Sub-packetization Level and Near Optimal Repair Bandwidth
Paper IdentifierTU3.R4.1
Authors Jie Li, Aalto University, Finland; Xiaohu Tang, Southwest Jiaotong University, China
Session Reed-Solomon and MDS Codes
Location Odéon, Level 3
Session Time Tuesday, 09 July, 14:30 - 16:10
Presentation Time Tuesday, 09 July, 14:30 - 14:50
Manuscript  Click here to download the manuscript
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 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.