arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.4620cs.ITmath.IT
收藏

更新有效的纠错乘积矩阵码

Update-Efficient Error-Correcting Product-Matrix Codes

Yunghsiang Han, Hung-Ta Pai, Rong Zheng, Pramod K. Varshney

摘要:

代码再生技术为分布式存储系统中故障节点的数据恢复提供了一种有效的方法。已经表明,再生代码可以被设计为最小化每个节点的存储(称为MSR)或最小化再生的通信开销(称为MBR)。在这项工作中,我们提出了新的编码方案的$[n,d]$纠错MSR和MBR码,推广我们以前的工作纠错再生码。我们表明,通过选择一个合适的对角矩阵,任何生成矩阵的$[n,α]$里德所罗门(RS)码可以集成到编码矩阵。利用$[n,k]$码和$[n,d]$ RS码的生成多项式的系数,提出了一种更新复杂度最小的MBR码编码方案。提出了一种利用$[n,α]$ RS码对MSR码进行数据重构的译码方案。所提出的解码方案具有更好的纠错能力,并招致最少的节点访问时,错误的存在。本文还针对MBR码提出了一种新的译码方案,该方案可以纠正更多的错误模式。

英文摘要:

Regenerating codes provide an efficient way to recover data at failed nodes in distributed storage systems. It has been shown that regenerating codes can be designed to minimize the per-node storage (called MSR) or minimize the communication overhead for regeneration (called MBR). In this work, we propose new encoding schemes for $[n,d]$ error-correcting MSR and MBR codes that generalize our earlier work on error-correcting regenerating codes. We show that by choosing a suitable diagonal matrix, any generator matrix of the $[n,α]$ Reed-Solomon (RS) code can be integrated into the encoding matrix. Hence, MSR codes with the least update complexity can be found. By using the coefficients of generator polynomials of $[n,k]$ and $[n,d]$ RS codes, we present a least-update-complexity encoding scheme for MBR codes. A decoding scheme is proposed that utilizes the $[n,α]$ RS code to perform data reconstruction for MSR codes. The proposed decoding scheme has better error correction capability and incurs the least number of node accesses when errors are present. A new decoding scheme is also proposed for MBR codes that can correct more error-patterns.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑