Name
Title | ||
|---|---|---|
An Efficient Piggybacking Design With Lower Repair Bandwidth And Lower Sub-Packetization |
Abstract | ||
|---|---|---|
Piggybacking is a class of coding framework for MDS array codes that can achieve small repair bandwidth with small sub-packetization. An (n, k, alpha) piggybacking code can be represented by an n x alpha array such that each node (row) stores alpha symbols and any k rows can retrieve all k alpha 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 alpha <= 8) and n - k >= 10. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/ISIT45174.2021.9518037 | 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
9 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhengyi Jiang | 1 | 0 | 0.34 |
| Hou Hanxu | 2 | 83 | 14.46 |
| Yunghsiang S. Han | 3 | 2472 | 159.76 |
| Zhongyi Huang | 4 | 67 | 12.67 |
| Bo Bai | 5 | 0 | 0.34 |
| Gong Zhang | 6 | 0 | 0.34 |