Exact-MSR Codes for Distributed Storage with Low Repair Complexity

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this paper, we propose two new constructions of exact-repair minimum storage regenerating (exact-MSR) codes. For both constructions, the encoded symbols are obtained by treating the message vector over GF(q) as a linearized polynomial and evaluating it over an extension field GF(q^m). For our exact-MSR codes, data repair does not need matrix inversion, and can be implemented by additions and multiplications over GF$(q)$ as well as cyclic shifts when a normal basis is used. The two constructions assume a base field of GF(q) (q>2) and GF(2), respectively. In contrast to existing constructions of exact-MSR codes, the former construction works for arbitrary code parameters, provided that $q$ is large enough. This is the first construction of exact-MSR codes with arbitrary code parameters, to the best of our knowledge. In comparison to existing exact-MSR codes, while data construction of our exact-MSR codes has a higher complexity, the complexity of data repair is lower. Thus, they are attractive for applications that need a small number of data reconstructions along with a large number of data repairs.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-488109

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.