Piggybacking design has been widely applied in distributed storage systems since it can greatly reduce the repair bandwidth with small sub-packetization. Compared with other existing erasure codes, piggybacking is more convenient to operate and the I/O cost is lower. In this paper, we propose a new efficient design which can further reduce the repair bandwidth with the sub-packetization $l\le r$ where $r = n-k$. Generally, we let $l\le 8$. Compared with other analogous designs, our design has lower $l$ and the value of $l$ is more flexible. Moreover, our design can repair all nodes with small repair bandwidth. Therefore our piggybacking design is more feasible.

翻译：随身携带设计在分布式储存系统中被广泛应用,因为它可以大大减少修理带宽,使用小小的子包装。 与其他现有的消除代码相比, 随身携带更方便操作, I/ O 成本也更低。 在本文中, 我们提出了一个新的高效设计, 可以用小的修理带宽来进一步减少修理带宽, 其次包装为$l\le r$, 其值为n- k$。 一般来说, 我们放用8美元。 与其他类似的设计相比, 我们的设计比低1美元, 美元的价值更灵活。 此外, 我们的设计可以用小的修理带宽来修复所有节点。 因此, 我们的搭载设计更可行 。