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

具有全符号局部性和可用性的码的界与构造

Bounds and Constructions of Codes with All-Symbol Locality and Availability

Stanislav Kruglik, Alexey Frolov

摘要:

研究了具有全符号局部性和可用性的线性局部可恢复码(LRC码)的距离性质。新的上限和下限的最小距离,这样的代码。上界是基于缩短方法,并改进现有的缩短界。为了减少上界和下界之间的差距,我们不限制字母表的大小,并提出明确的建设代码的局部性和可用性,通过秩度量码。第一种构造依赖于扩展图,在低速率区域较好,第二种构造利用Wang等人开发的LRC码作为内码,在高速率区域较好。

英文摘要:

We investigate the distance properties of linear locally recoverable codes (LRC codes) with all-symbol locality and availability. New upper and lower bounds on the minimum distance of such codes are derived. The upper bound is based on the shortening method and improves existing shortening bounds. To reduce the gap in between upper and lower bounds we do not restrict the alphabet size and propose explicit constructions of codes with locality and availability via rank-metric codes. The first construction relies on expander graphs and is better in low rate region, the second construction utilizes LRC codes developed by Wang et al. as inner codes and better in high rate region.

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

↑