Adversarial Error Resilience in Distributed Storage Using MRD Codes and MDS Array Codes

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

submitted to IEEE ISIT 2012

Scientific paper

This paper presents a novel coding scheme for distributed storage systems containing nodes with adversarial errors. The key challenge in such systems is the propagation of the erroneous data from a single corrupted node to the rest of the system during node repair process. We present a concatenated coding scheme which is based on two types of codes: maximum rank distance (MRD) code as an outer code and optimal repair maximal distance separable (MDS) array code as an inner code. We prove that this coding scheme attains the upper bound on the resilience capacity, i.e., amount of data stored reliably in a system with a limited number of corrupted nodes.

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

Adversarial Error Resilience in Distributed Storage Using MRD Codes and MDS Array 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 Adversarial Error Resilience in Distributed Storage Using MRD Codes and MDS Array Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adversarial Error Resilience in Distributed Storage Using MRD Codes and MDS Array Codes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-5604

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