Zihao Zhang

activity

20242026

(h, d)

cooperative MSR codes with sub-packetization

(d - k + h) (d - k + 1)^{⌈ n /2 ⌉}

6 citations · 6 across the 2 of their papers we have counts for

collaborators

Showing cs.ITShow all

4 papers · 1 filter

cs.IT2026

From Linear Exact Repair to Mixed-Alphabet Codes: The Bandwidth-Subpacketization Tradeoff of MDS Array Codes

Zihao Zhang, Guodong Li, Sihuang Hu

MDS array codes achieve optimal storage efficiency in distributed storage systems, but their repair bandwidth depends critically on the sub-packetization level. While the theoretic…

cs.IT2025

Optimal Repair of $(k + 2, k, 2)$ MDS Array Codes

Zihao Zhang, Guodong Li, Sihuang Hu

Maximum distance separable (MDS) codes are widely used in distributed storage systems as they provide optimal fault tolerance for a given amount of storage overhead. The seminal wo…

cs.IT2025

Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair

Lewen Wang, Zihao Zhang, Sihuang Hu

We establish lower bounds on the sub-packetization of optimal-access MSR codes in the context of multiple-node failures. These bounds generalize the tight bounds for single-node fa…

cs.IT2024★ 6 cited

Constructing $(h, d)$ cooperative MSR codes with sub-packetization $(d - k + h) (d - k + 1)^{⌈ n /2 ⌉}$

Zihao Zhang, Guodong Li, Sihuang Hu

We address the multi-node failure repair challenges for MDS array codes. Presently, two primary models are employed for multi-node repairs: the centralized model where all failed n…

From Linear Exact Repair to Mixed-Alphabet Codes: The Bandwidth-Subpacketization Tradeoff of MDS Array Codes

Optimal Repair of (k+2,k,2) MDS Array Codes

Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair

Constructing (h,d) cooperative MSR codes with sub-packetization (d−k+h)(d−k+1)⌈n/2⌉

Optimal Repair of $(k + 2, k, 2)$ MDS Array Codes

Constructing $(h, d)$ cooperative MSR codes with sub-packetization $(d - k + h) (d - k + 1)^{⌈ n /2 ⌉}$