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

Abstract

In this paper, we reinterprets 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.

11 pages

References in corpus (1)

• On Codes for Optimal Rebuilding Access