Repairing Reed-Solomon codes: Universally achieving the cut-set bound for any number of erasures
Repairing Reed-Solomon codes: Universally achieving the cut-set bound for any number of erasures
复制标题
修复里德所罗门码：普遍实现任意数量擦除的割集界限
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
A. Barg
中科院分区：
文献类型：
--
作者：
Min Ye;A. Barg
一个编码的修复带宽是修复一个或多个故障节点（擦除）所需的最小数据量。对于MDS码，修复带宽受所谓的割集界下限约束，并且等式满足此界的编码被认为支持一个或多个故障节点的最优修复。
我们考虑里德 - 所罗门（RS）码的多个故障节点修复问题。在与I. 塔莫（I. Tamo）最近的一项工作中（《IEEE计算机科学基础年会论文集》2017），我们首次给出了从任意辅助节点子集对任意单个故障节点进行最优修复的RS码的显式构造。在本文中，我们构造了显式的RS码，对于从任意一组辅助节点修复任意数量的故障节点，普遍达到割集界。此外，我们编码的节点大小接近具有此类性质的编码的最优（尽可能小的）节点大小。
The repair bandwidth of a code is the minimum amount of data required to repair one or several failed nodes (erasures). For MDS codes, the repair bandwidth is bounded below by the so-called cut-set bound, and codes that meet this bound with equality are said to support optimal repair of one or multiple failed nodes.
We consider the problem of repairing multiple failed nodes of Reed-Solomon (RS) codes. In a recent work with I. Tamo (Proc. IEEE FOCS 2017), we gave the first explicit construction of RS codes with optimal repair of any single failed node from any subset of helper nodes. In this paper, we construct explicit RS codes that universally achieve the cut-set bound for the repair of any number of failed nodes from any set of helper nodes. Moreover, the node size of our codes is close to the optimal (smallest possible) node size of codes with such property.
DOI：
10.1109/allerton.2017.8262840
发表时间：
2017-10
期刊：
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
影响因子：
--
作者：
Ameera Chowdhury;A. Vardy
通讯作者：
Ameera Chowdhury;A. Vardy