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

长度为$\frac{q^m-1}{\lambda}$的狭义BCH码的对偶码

The duals of narrow-sense BCH codes with length $\frac{q^m-1}λ$

Xiaoqiang Wang, Chengliang Xiao, Dabin Zheng

AI总结:

本文研究有限域上长度为$(q^m-1)/\lambda$的狭义BCH码对偶码,给出其最小距离下界及成为dually-BCH码的充要条件,并推广已有结果。

摘要:

BCH码因其高效的编码与译码算法而成为一类引人关注的循环码。在过去六十年中,BCH码的研究取得了大量进展,但人们对其对偶码性质的了解仍然很少。近来,为了研究BCH码的对偶码及其最小距离下界,文献\cite{GDL21}的作者提出了一个称为对偶BCH码(dually-BCH code)的新概念。本文建立了有限域$\mathbb{F}_q$上长度为$\frac{q^m-1}{\lambda}$的狭义BCH码对偶码最小距离的下界,其中$\lambda$是满足$\lambda\mid q-1$的正整数,或者取$\lambda=q^s-1$且$s\mid m$。此外,文中还给出了这些码成为对偶BCH码在设计距离方面的充分必要条件。文献\cite{GDL21}和\cite{Wang23}中考虑的许多码都是本文所给码的特例。我们关于BCH码对偶码最小距离的下界将文献\cite{GDL21}所述界作为特例包含在内。若干例子表明,这些下界在某些情形下是良好的。

英文摘要:

BCH codes are an interesting class of cyclic codes due to their efficient encoding and decoding algorithms. In the past sixty years, a lot of progress on the study of BCH codes has been made, but little is known about the properties of their duals. Recently, in order to study the duals of BCH codes and the lower bounds on their minimum distances, a new concept called dually-BCH code was proposed by authors in \cite{GDL21}. In this paper, the lower bounds on the minimum distances of the duals of narrow-sense BCH codes with length $\frac{q^m-1}λ$ over $\mathbb{F}_q$ are developed, where $λ$ is a positive integer satisfying $λ\, |\, q-1$, or $λ=q^s-1$ and $s\, |\,m$. In addition, the sufficient and necessary conditions in terms of the designed distances for these codes being dually-BCH codes are presented. Many considered codes in \cite{GDL21} and \cite{Wang23} are the special cases of the codes showed in this paper. Our lower bounds on the minimum distances of the duals of BCH codes include the bounds stated in \cite{GDL21} as a special case. Several examples show that the lower bounds are good in some cases.

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

↑