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

循环码界的推广,包括HT和BS界

A generalization of bounds for cyclic codes, including the HT and BS bounds

Matteo Piva, Massimiliano Sala

摘要:

利用循环码的代数结构和离散傅里叶变换的一些性质,通过线性代数的推广,给出了循环码距离的几个经典界的一个新的表达式.本文提出了一个计算复杂性为多项式有界的界,它是Hartmann-Tzeng界和Betti-Sala界的推广.在大多数计算的情况下,我们的界限是所有已知的多项式时间的界限,包括Roos界限中最紧的。

英文摘要:

We use the algebraic structure of cyclic codes and some properties of the discrete Fourier transform to give a reformulation of several classical bounds for the distance of cyclic codes, by extending techniques of linear algebra. We propose a bound, whose computational complexity is polynomial bounded, which is a generalization of the Hartmann-Tzeng bound and the Betti-Sala bound. In the majority of computed cases, our bound is the tightest among all known polynomial-time bounds, including the Roos bound.

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

↑