A Construction of Systematic MDS Codes With Minimum Repair Bandwidth
IEEE Transactions on Information Theory（2011）
摘要
In a distributed storage system based on erasure coding, an important problem is the 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.
更多查看译文
关键词
digital storage,new encoded piece,mds code,erasure coding,systematic mds code,encoding,repair problem,minimum repair bandwidth,systematic mds codes,computer network reliability,distributed storage,important problem,storage system,new node,distributed processing,distributed storage system,erasure code,maintenance engineering,systematics,network coding,bandwidth,polynomials,indexing terms
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要