On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage

Details On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage

2010-04-26

arxiv.org/abs/1004.4663v1

Computer Science

Information Theory

20 pages, 6 figures

Scientific paper

The high repair cost of (n,k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off storage cost for repair bandwidth. In this paper, we address bandwidth-optimal (n,k,d) Exact-Repair MDS codes, which allow for any failed node to be repaired exactly with access to arbitrary d survivor nodes, where k<=d<=n-1. We show the existence of Exact-Repair MDS codes that achieve minimum repair bandwidth (matching the cutset lower bound) for arbitrary admissible (n,k,d), i.e., k

Affiliated with

Also associated with

No associations

Rating

On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-236543