Searching for Minimum Storage Regenerating Codes

Details Searching for Minimum Storage Regenerating Codes Searching for Minimum Storage Regenerating Codes

2009-10-12

arxiv.org/abs/0910.2245v1

Computer Science

Information Theory

Scientific paper

Regenerating codes allow distributed storage systems to recover from the loss of a storage node while transmitting the minimum possible amount of data across the network. We present a systematic computer search for optimal systematic regenerating codes. To search the space of potential codes, we reduce the potential search space in several ways. We impose an additional symmetry condition on codes that we consider. We specify codes in a simple alternative way, using additional recovered coefficients rather than transmission coefficients and place codes into equivalence classes to avoid redundant checking. Our main finding is a few optimal systematic minimum storage regenerating codes for $n=5$ and $k=3$, over several finite fields. No such codes were previously known and the matching of the information theoretic cut-set bound was an open problem.

Affiliated with

Also associated with

No associations

Rating

Searching for Minimum Storage Regenerating Codes 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 Searching for Minimum Storage Regenerating Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Searching for Minimum Storage Regenerating Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-639751