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

关于最优$(r,δ)$ LRC的改进界和构造的一些结果

Some Results on the Improved Bound and Construction of Optimal $(r,δ)$ LRCs

Bin Chen, Weijun Fang, Yueqi Chen, Shu-Tao Xia, Fang-Wei Fu, Xiangyu Chen

摘要:

具有$(r,δ)$局部性的局部可修复码(LRC)是由Prakash \emph{et al.}引入到分布式存储系统(DSS)中的,因为它们的优点是通过同一局部组中的其他$r$生存节点来局部修复至少$δ-1$擦除。达到$(r,δ)$ Singleton型界限的LRC称为最优$(r,δ)$ LRC。构造具有较长码长的最优$(r,δ)$ LRC并确定最大码长是近年来编码理论的一个重要研究方向。本文对最优$(r,δ)$ LRC的最大码长的改进进行了进一步的研究。对于$2δ+1\leq d\leq 2δ+2$,我们的上界在很大程度上改进了Cai \emph{et al.}的上界,在某些特殊情况下,上界是紧的.进一步推广了Chen \emph{et al.}的结果,得到了有限射影平面$PG(2,q)$上最优$(r=2, δ)$ -LRC在几何存在意义下的完整刻画.在这个几何特征,我们构建了一类最佳的$(r,δ)$ LRC的基础上的向日葵结构。无论是构造还是上界都比以前的结果好。

英文摘要:

Locally repairable codes (LRCs) with $(r,δ)$ locality were introduced by Prakash \emph{et al.} into distributed storage systems (DSSs) due to their benefit of locally repairing at least $δ-1$ erasures via other $r$ survival nodes among the same local group. An LRC achieving the $(r,δ)$ Singleton-type bound is called an optimal $(r,δ)$ LRC. Constructions of optimal $(r,δ)$ LRCs with longer code length and determining the maximal code length have been an important research direction in coding theory in recent years. In this paper, we conduct further research on the improvement of maximum code length of optimal $(r,δ)$ LRCs. For $2δ+1\leq d\leq 2δ+2$, our upper bounds largely improve the ones by Cai \emph{et al.}, which are tight in some special cases. Moreover, we generalize the results of Chen \emph{et al.} and obtain a complete characterization of optimal $(r=2, δ)$-LRCs in the sense of geometrical existence in the finite projective plane $PG(2,q)$. Within this geometrical characterization, we construct a class of optimal $(r,δ)$ LRCs based on the sunflower structure. Both the construction and upper bounds are better than previous ones.

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

↑