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

preprint2015arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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