← 研踪 PaperTrailarXiv:2510.23316 · v2
Efficient Repair of (k+2, k) Degraded Read Friendly MDS Array Codes With Sub-packetization 2
首次提交 2025-10-27 21:27
版本更新 2026-11-03 21:36
雷达观测 2026-11-04 23:39
摘要
In this paper, we present two constructions of degraded read friendly (DRF) MDS array codes with two parity nodes and a sub-packetization level of 2 over small finite fields, applicable for any arbitrary code length. The first construction achieves the smallest repair bandwidth among all existing constructions with the same parameters, and is asymptotically optimal with respect to the lower bound on the average repair bandwidth characterized by Zhang et al. The second construction supports two repair mechanisms, depending on whether computation within the helper nodes is permitted or not during the node repair process, thereby optimizing either the repair bandwidth or the rebuilding access.
作者备注：Accepted for publication in the IEEE Transactions on Information Theory
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-03 21:36 · 最新观测版本
Efficient Repair of (k+2, k) Degraded Read Friendly MDS Array Codes With Sub-packetization 2
In this paper, we present two constructions of degraded read friendly (DRF) MDS array codes with two parity nodes and a sub-packetization level of 2 over small finite fields, applicable for any arbitrary code length. The first construction achieves the smallest repair bandwidth among all existing constructions with the same parameters, and is asymptotically optimal with respect to the lower bound on the average repair bandwidth characterized by Zhang et al. The second construction supports two repair mechanisms, depending on whether computation within the helper nodes is permitted or not during the node repair process, thereby optimizing either the repair bandwidth or the rebuilding access.
查看此版本解读 →查看此版本原文 ↗