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

基于传播规则的良好局部可修码

Good locally repairable codes via propagation rules

Shu Liu, Liming Ma, Tingyi Wu, Chaoping Xing

摘要:

在经典编码理论中,通常通过传播规则来构造新的码。构造经典分组码有多种传播规则。然而,传播规则还没有被广泛探讨的建设局部可修复的代码。在本文中,我们引入一些传播规则来构造好的局部可修码。令我们惊讶的是,这些简单的传播规则产生了一些有趣的结果。首先,通过将一个局部可修码作为内码与一个经典分组码作为外码级联,得到了多个维数最优的二元局部可修码。其次,从这个串联,我们明确地建立一个家庭的本地可修复的代码,超过Zyablov型的界限。第三,通过对给定线性码的校验矩阵增加行和列的加长传播规则,我们可以从扩展汉明码生成一族维数最优的二元局部可修码,并将经典的最大距离可分(MDS)码转换为Singleton最优的局部可修码。此外,通过延长传播规则,我们大大简化了\cite [定理5]{MX 20}中一族局部可修码的构造,该局部可修码突破了渐近Gilbert-Varshamov界。此外,我们利用其他三个传播规则,以产生更多的维度最优的二进制局部可修复码。最后,我们观察到的一个现象是,经典分组码中的一些平凡的传播规则不再适用于局部可修码。

英文摘要:

In classical coding theory, it is common to construct new codes via propagation rules. There are various propagation rules to construct classical block codes. However, propagation rules have not been extensively explored for constructions of locally repairable codes. In this paper, we introduce a few propagation rules to construct good locally repairable codes. To our surprise, these simple propagation rules produce a few interesting results. Firstly, by concatenating a locally repairable code as an inner code with a classical block code as an outer code, we obtain quite a few dimension-optimal binary locally repairable codes. Secondly, from this concatenation, we explicitly build a family of locally repairable codes that exceeds the Zyablov-type bound. Thirdly, by a lengthening propagation rule that adds some rows and columns from a parity-check matrix of a given linear code, we are able to produce a family of dimension-optimal binary locally repairable codes from the extended Hamming codes, and to convert a classical maximum distance separable (MDS) code into a Singleton-optimal locally repairable code. Furthermore, via the lengthening propagation rule, we greatly simplify the construction of a family of locally repairable codes in \cite[Theorem 5]{MX20} that breaks the asymptotic Gilbert-Varshamov bound. In addition, we make use of three other propagation rules to produce more dimension-optimal binary locally repairable codes. Finally, one of phenomena that we observe in this paper is that some trivial propagation rules in classical block codes do not hold anymore for locally repairable codes.

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

↑