arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1302.4129cs.ITmath.IT
收藏

GF上修复最优的MDS阵列码(2)

Repair-Optimal MDS Array Codes over GF(2)

Eyal En Gad, Robert Mateescu, Filip Blagojevic, Cyril Guyot, Zvonimir Bandic

摘要:

最大距离可分阵列码(MDS)是近年来提出的一种具有高码率和最优修复性能的阵列码。这些代码可以应用在分布式存储系统中,在那里它们最大限度地减少了恢复故障节点所需的通信和磁盘访问。然而,所提出的代码的编码和解码算法使用阶数大于2的有限域上的算术,这可能导致复杂的实现。在这项工作中,我们提出了一个2-奇偶MDS阵列码的建设,允许最佳的修复失败的信息节点只使用XOR操作。当用户改变单个信息位时,通过允许更新更多的奇偶校验位来实现字段顺序的减少。

英文摘要:

Maximum-distance separable (MDS) array codes with high rate and an optimal repair property were introduced recently. These codes could be applied in distributed storage systems, where they minimize the communication and disk access required for the recovery of failed nodes. However, the encoding and decoding algorithms of the proposed codes use arithmetic over finite fields of order greater than 2, which could result in a complex implementation. In this work, we present a construction of 2-parity MDS array codes, that allow for optimal repair of a failed information node using XOR operations only. The reduction of the field order is achieved by allowing more parity bits to be updated when a single information bit is being changed by the user.

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

↑