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

关于某些Goppa码和BCH码的最小距离

On the Minimum Distances of Some Families of Goppa Codes and BCH Codes

College of Cyber Security, Jinan University(暨南大学网络空间安全学院);College of Information Science and Technology, Jinan University(暨南大学信息科学技术学院);Department of Computer Science and Engineering, The Hong Kong University of Science and Technology(香港科技大学计算机科学与工程系);Strategic Centre for Research in Privacy-Preserving Technologies and Systems, Nanyang Technological University(南洋理工大学隐私保护技术与系统战略研究中心)

Yaqi Chen, Hao Chen, Cunsheng Ding, Huimin Lao

AI总结:

本文提出Goppa码达到设计距离的充要条件,并确定了若干q进制Goppa码的最小距离,扩展了BCH码家族,改进了BCH码最小距离的条件。

摘要:

Goppa码是重要的交替码类,在代数编码理论和基于码的密码学中有广泛应用。确定Goppa码的真实最小距离是一个困难的问题。本文提供了一个Goppa码达到其设计距离δ=t+1的充要条件,其中t是Goppa多项式的次数。作为应用,我们确定了几类q进制Goppa码的最小距离。特别是,我们证明了某类野Goppa码改进下界的真实性,并将G(x)=x^t的家族从二进制情况扩展到任意奇素数幂。然后,我们将该准则专门应用于单项情况G(x)=x^t,即等价于原始BCH码。这导致了若干无限族的原始BCH码,其距离d=δ,包括二进制码C_{(2,2^m-1,9,1)}和C_{(2,2^m-1,15,1)},奇素数p的家族C_{(p,p^p-1,2p+2,1)},以及q进制的家族C_{(q,q^m-1,r\frac{q^m-1}{q-1}+1,1)},其中r整除q-1。特别是,我们证明了原始BCH码C_{(q,q^m-1,q^t+1,1)}在条件t整除m时具有最小距离q^t+1,改进了之前已知的条件pt整除m。

英文摘要:

Goppa codes form an important class of alternant codes with wide applications in algebraic coding theory and code-based cryptography. Determining the true minimum distance of a Goppa code is a difficult problem. In this paper, we provide a necessary and sufficient criterion for a Goppa code to attain its designed distance $δ=t+1$, where $t$ is the degree of the Goppa polynomial. As applications, we determine the minimum distances of several classes of $q$-ary Goppa codes. In particular, we prove the tightness of the improved lower bound for a class of wild Goppa codes, and extend the family with $G(x)=x^t+A$ from the binary case to arbitrary odd prime powers. We then specialize the criterion to the monomial case $G(x)=x^t$, which is equivalent to primitive BCH codes. This leads to several infinite families of primitive BCH codes with $d=δ$, including the binary codes $\mathbf{C}_{(2,2^m-1,9,1)}$ and $\mathbf{C}_{(2,2^m-1,15,1)}$, the family $\mathbf{C}_{(p,p^p-1,2p+2,1)}$ with an odd prime $p$ and the family $\mathbf{C}_{(q,q^m-1,r\frac{q^m-1}{q-1}+1,1)}$ with $r\mid q-1$. In particular, we prove that the primitive BCH code $\mathbf{C}_{(q,q^m-1,q^t+1,1)}$ has minimum distance $q^t+1$ under the condition $t\mid m$, improving the previously known condition $pt\mid m$.

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

↑