arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.10262cs.ITcs.DMcs.DSmath.IT
收藏

局部可恢复码的容量

Capacity of Locally Recoverable Codes

Arya Mazumdar

AI总结:

本文分析了局部可恢复码(LRC)在随机擦除或错误信道上的性能,针对输入对称的无记忆离散信道,给出了使用LRC时与Shannon容量差距的紧致刻画,适用于纠正多个局部擦除的一般性LRC。

摘要:

受分布式存储应用的推动,局部可恢复码(LRC)的概念在几年前被提出。在LRC中,码字的任意坐标仅需访问少量其他坐标即可恢复。尽管LRC的各项性质已被充分研究,但其在随机擦除或错误的信道上的性能却基本未被探索。本文分析了LRC在此类随机信道上的性能。具体而言,对于输入对称的无记忆离散信道,我们给出了在信道上使用LRC时与Shannon容量之间差距的紧致刻画。我们的结果适用于可纠正多个局部擦除的LRC的一般性定义。

英文摘要:

Motivated by applications in distributed storage, the notion of a locally recoverable code (LRC) was introduced a few years back. In an LRC, any coordinate of a codeword is recoverable by accessing only a small number of other coordinates. While different properties of LRCs have been well-studied, their performance on channels with random erasures or errors has been mostly unexplored. In this paper, we analyze the performance of LRCs over such stochastic channels. In particular, for input-symmetric discrete memoryless channels, we give a tight characterization of the gap to Shannon capacity when LRCs are used over the channel. Our results hold for a general notion of LRCs that correct multiple local erasures.

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

↑