Systematic Construction of MDS Codes with Small Sub-packetization Level and Near Optimal Repair Bandwidth

Jie Li, Xiaohu Tang

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

3 Citations (Scopus)
24 Downloads (Pure)

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.

Original languageEnglish
Title of host publication2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PublisherIEEE
Pages1067-1071
Number of pages5
ISBN (Electronic)9781538692912
DOIs
Publication statusPublished - 1 Jul 2019
MoE publication typeA4 Article in a conference publication
EventIEEE International Symposium on Information Theory - Paris, France
Duration: 7 Jul 201912 Jul 2019

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2019-July
ISSN (Print)2157-8095

Conference

ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
CountryFrance
CityParis
Period07/07/201912/07/2019

Fingerprint Dive into the research topics of 'Systematic Construction of MDS Codes with Small Sub-packetization Level and Near Optimal Repair Bandwidth'. Together they form a unique fingerprint.

Cite this