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(南洋理工大学隐私保护技术与系统战略研究中心)
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$.
Generalized BCH Codes and Twisted Goppa Codes Attaining Their Designed Distances
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(南洋理工大学隐私保护技术与系统战略研究中心);Hetao Institute of Mathematics and Interdisciplinary Sciences(深圳河套数学与交叉科学研究所)
On the Minimum Distances of Some Families of 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(南洋理工大学隐私保护技术与系统研究中心)
A Criterion to Determine True Minimum Distances of Goppa Codes
College of Information Engineering, Shanghai Maritime University(上海海事大学信息工程学院);College of Information Science and Technology, Jinan University(暨南大学信息科学技术学院);College of Cyber Security, Jinan University(暨南大学网络安全学院);School of Mathematics, Nanjing University of Aeronautics and Astronautics(南京航空航天大学数学学院);MoE Engineering Research Center of Software/Hardware Co-Design Technology and Application, East China Normal University(华东师范大学软件/硬件协同设计技术与应用教育部工程研究中心);State Key Laboratory of Cryptography and Digital Economy Security, Shandong University(山东大学密码与数字经济安全国家重点实验室)
在本文中,我们展示了如何构造新的卷积码从旧的应用众所周知的技术:打孔,扩展,扩大,直接和,(u| u + v)构造和乘积码构造。通过应用这些方法,可以构造几个新的卷积码族。作为码扩展的一个例子,构造了从经典的Bose-Chaudhuri-Hocquenghem(BCH)、特征码和Melas码导出的卷积码族。
在量子信息处理中,相移误差比量子位翻转误差发生的概率更大,因而前者对量子信息的干扰更大。这使得我们构造了非对称量子差错控制码$\Pr Z \geq \Pr X$来保护非对称信道上的量子信息。本文提出了两种利用生成多项式和定义经典循环码集合导出非对称量子循环码的一般方法。因此,该方法使我们能够构建几个家庭的非对称量子BCH,RS和RM码。最后,利用这些方法构造了非对称子系统码族。