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

具有四次擦除局部性的二进制码

Binary Codes with Locality for Four Erasures

S. B. Balaji, K. P. Prasanth, P. Vijay Kumar

摘要:

本文研究了具有局部性的四重擦除码。从四个擦除顺序恢复的局部性代码的速率上界。这里导出的速率界是场无关的。还提供了满足该速率界的二进制码的最佳构造。该构造基于周长$6$的正则图,并采用了从多个擦除中局部恢复的顺序方法。这种结构的扩展,产生的代码,可以顺序地从五个擦除恢复也提出。

英文摘要:

In this paper, codes with locality for four erasures are considered. An upper bound on the rate of codes with locality with sequential recovery from four erasures is derived. The rate bound derived here is field independent. An optimal construction for binary codes meeting this rate bound is also provided. The construction is based on regular graphs of girth $6$ and employs the sequential approach of locally recovering from multiple erasures. An extension of this construction that generates codes which can sequentially recover from five erasures is also presented.

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

↑