A Construction of Systematic MDS Codes with Minimum Repair Bandwidth

Details A Construction of Systematic MDS Codes with Minimum Repair Bandwidth A Construction of Systematic MDS Codes with Minimum Repair Bandwidth

2009-10-13

arxiv.org/abs/0910.2486v1

Computer Science

Information Theory

Submitted to IEEE Transactions on Information Theory on August 14, 2009

Scientific paper

In a distributed storage system based on erasure coding, an important problem is the \emph{repair problem}: If a node storing a coded piece fails, in order to maintain the same level of reliability, we need to create a new encoded piece and store it at a new node. This paper presents a construction of systematic $(n,k)$-MDS codes for $2k\le n$ that achieves the minimum repair bandwidth when repairing from $k+1$ nodes.

Affiliated with

Also associated with

No associations

Rating

A Construction of Systematic MDS Codes with Minimum Repair Bandwidth 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 A Construction of Systematic MDS Codes with Minimum Repair Bandwidth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Construction of Systematic MDS Codes with Minimum Repair Bandwidth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-18413