An Efficient Piggybacking Design with Lower Repair Bandwidth and Lower Sub-packetization
Zhengyi Jiang, Hanxu Hou, Yunghsiang S. Han, Zhongyi Huang, Bo Bai, Gong Zhang
Abstract
Piggybacking is a class of coding framework for MDS array codes that can achieve small repair bandwidth with small sub-packetization. An (<tex>$n, k, \alpha$</tex>) piggybacking code can be represented by an <tex>$n\times \alpha$</tex> array such that each node (row) stores <tex>$\alpha$</tex> symbols and any <tex>$k$</tex> rows can retrieve all <tex>$k\alpha$</tex> data symbols. In this paper, we first propose a new piggybacking framework for MDS array codes with lower sub-packetization and then propose two specific piggybacking codes based on the proposed framework. We show that the average repair bandwidth of any single-node failure of our piggybacking codes is lower than all the existing piggybacking codes with the same parameters when the sub-packetization is small (usually <tex>$\alpha\leq 8$</tex>) and <tex>$n-k\geq 10$</tex>.