Conjugate-Piggybacking Codes: MDS Array Codes with Lower Repair Bandwidth over Small Field Size

被引：0

作者：

Shi, Hao ^{[1
]}

Jiang, Zhengyi ^{[1
,2
]}

Huang, Zhongyi ^{[1
]}

Bai, Bo ^{[2
]}

Zhang, Gong ^{[2
]}

Hou, Hanxu ^{[2
]}

机构：

[1] Tsinghua Univ, Dept Math Sci, Beijing, Peoples R China

[2] Huawei Tech Co Ltd, Cent Res Inst, Theory Lab, 2012 Labs, Hong Kong, Peoples R China

来源：

2024 IEEE INFORMATION THEORY WORKSHOP, ITW 2024 | 2024年

基金：

中国国家自然科学基金;

关键词：

DISTRIBUTED STORAGE; DESIGN;

D O I：

10.1109/ITW61385.2024.10806951

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

As maximum distance separable (MDS) array codes, piggybacking codes can effectively reduce the repair bandwidth of traditional MDS codes for single-node failure with small sub-packetization. However, the requirement of maintaining MDS property over small field size imposes severe restrictions on the design of piggyback functions in the piggybacking framework, which limits the reduction of repair bandwidth. In this paper, we propose conjugate-piggybacking codes over a small sub-packetization level. We design conjugate transformation for piggyback functions in our codes, which enables some parity nodes to achieve optimal repair bandwidth. We show that our codes are MDS codes over a slightly larger field size than the existing related piggybacking codes. We also show that our codes have lower repair bandwidth than the existing related piggybacking codes under evaluated high-code-rate parameters and F-2(8).

引用

页码：271 / 276

页数：6

共 24 条

[11] An Efficient One-to-One Piggybacking Design for Distributed Storage Systems [J].