Optimal Exact Repair Strategy for the Parity Nodes of the $(k+2,k)$ Zigzag Code

In this paper, we reinterpret the (k+2, k) zigzag code in coding matrix and then propose an optimal exact repair strategy for its parity nodes, whose repair disk I/O approaches a lower bound derived in this paper.