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

可修复喷泉码

Repairable Fountain Codes

Megasthenis Asteris, Alexandros G. Dimakis

摘要:

我们介绍了一个新的家庭喷泉码的系统,也有稀疏的奇偶校验。给定$k$符号的输入,我们的代码产生无限数量的输出符号,通过线性组合对数数量的随机选择的输入符号独立地生成每个奇偶校验。该构造保证对于访问$(1+ε)k$编码符号的随机子集的任何$ε>0$,渐近地足以以高概率恢复$k$输入符号。我们的代码具有对数局部性的额外好处:单个丢失的符号可以通过访问剩余编码符号的$O(\log k)$子集来修复。这是分布式存储系统的期望属性,其中符号分布在存储节点的网络上。除了在丢失时恢复之外,局部重建为读取不能直接访问的符号提供了有效的替代方案。在我们的代码中,对数数量的不相交的局部组与每个系统符号相关联,允许多个并行读取。我们的主要数学贡献是分析有限域上具有特定结构的稀疏随机矩阵的秩。我们依赖于建立一个新的家庭的稀疏随机二部图具有高概率的完美匹配。

英文摘要:

We introduce a new family of Fountain codes that are systematic and also have sparse parities. Given an input of $k$ symbols, our codes produce an unbounded number of output symbols, generating each parity independently by linearly combining a logarithmic number of randomly selected input symbols. The construction guarantees that for any $ε>0$ accessing a random subset of $(1+ε)k$ encoded symbols, asymptotically suffices to recover the $k$ input symbols with high probability. Our codes have the additional benefit of logarithmic locality: a single lost symbol can be repaired by accessing a subset of $O(\log k)$ of the remaining encoded symbols. This is a desired property for distributed storage systems where symbols are spread over a network of storage nodes. Beyond recovery upon loss, local reconstruction provides an efficient alternative for reading symbols that cannot be accessed directly. In our code, a logarithmic number of disjoint local groups is associated with each systematic symbol, allowing multiple parallel reads. Our main mathematical contribution involves analyzing the rank of sparse random matrices with specific structure over finite fields. We rely on establishing that a new family of sparse random bipartite graphs have perfect matchings with high probability.

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

↑