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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.