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≤n that achieves the minimum repair bandwidth when repairing from k+1 nodes.
@article{arxiv.0910.2486,
title = {A Construction of Systematic MDS Codes with Minimum Repair Bandwidth},
author = {Yunnan Wu},
journal= {arXiv preprint arXiv:0910.2486},
year = {2016}
}
Comments
Submitted to IEEE Transactions on Information Theory on August 14, 2009