A Systematic Piggybacking Design for Minimum Storage Regenerating Codes

DOI10.1109/TIT.2015.2472524MaRDI QIDQ2977091zbMATH OpenOpenAlexFDO

Authors Bin Yang, Xiaohu Tang, Jie Li

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.5468

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: Piggybacking is an efficient method to decrease the repair bandwidth of Maximum Distance Separable (MDS) codes or Minimum Storage Regenerating (MSR) codes. In this paper, for minimizing the repair bandwidth of parity nodes of the known MSR codes with high rate, which is usually the whole size of the original data, i.e., the maximal, a new systematic piggybacking design is proposed through an in-depth analysis of the design of piggybacking. As a result, new MSR codes are obtained with almost optimal repair bandwidth of parity nodes while retaining the optimal repair bandwidth of systematic nodes. Furthermore, MSR codes with balanced download during node repair process are presented based on the new piggybacking design.

Cited in

(4)

• A new piggybacking design for systematic MDS storage codes
• Construction of minimum bandwidth regenerating codes with combinatorial design
• An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes
• A new repair-efficient piggybacking design for systematic nodes

This page was built for publication: A Systematic Piggybacking Design for Minimum Storage Regenerating Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977091)