  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.
