Goppa, in the 1970s, discovered the relation between algebraic geometry and codes, which led to the family of Goppa codes. As one of the most interesting subclasses of linear codes, the family of Goppa codes is often chosen as a key in the McEliece cryptosystem. Knowledge of the number of inequivalent binary Goppa codes for fixed parameters may facilitate in the evaluation of the security of such a cryptosystem. Let $n\geq5$ be an odd prime number, let $q=2^n$ and let $r\geq3$ be a positive integer satisfying $\gcd(r,n)=1$. The purpose of this paper is to establish an upper bound on the number of inequivalent extended irreducible binary Goppa codes of length $q+1$ and degree $r$.A potential mathematical object for this purpose is to count the number of orbits of the projective semi-linear group ${\rm PGL}_2(\mathbb{F}_q)\rtimes{\rm Gal}(\mathbb{F}_{q^r}/\mathbb{F}_2)$ on the set $\mathcal{I}_r$ of all monic irreducible polynomials of degree $r$ over the finite field $\mathbb{F}_q$. An explicit formula for the number of orbits of ${\rm PGL}_2(\mathbb{F}_q)\rtimes{\rm Gal}(\mathbb{F}_{q^r}/\mathbb{F}_2)$ on $\mathcal{I}_r$ is given, and consequently, an upper bound for the number of inequivalent extended irreducible binary Goppa codes of length $q+1$ and degree $r$ is derived. Our main result naturally contains the main results of Ryan (IEEE-TIT 2015), Huang and Yue (IEEE-TIT, 2022) and, Chen and Zhang (IEEE-TIT, 2022), which considered the cases $r=4$, $r=6$ and $\gcd(r,q^3-q)=1$ respectively.
List-decoding of binary Goppa codes up to the binary Johnson bound
以经典Goppa码为例,研究了交替码的列表译码问题。这里的主要考虑因素是考虑字母表的大小,这对列表解码半径有很大的影响。这相当于比较结合的\emph{generic} Johnson与结合的\emph{$q$-ary} Johnson。当$q$非常小时,这种差异很重要。基本上,最有利的情况是$q=2$,对于它,解码半径大大提高,特别是当相对最小距离接近1/2时。即使宣布的结果,这是二进制Goppa码的列表解码半径,是新的,它可以很容易地从以前的来源(V. Guruswami,R。M.罗斯和我Tal,R. M. Roth),这可能是一个有点未知的,其中的情况下,二进制Goppa码显然没有被认为在。只有D. J. Bernstein在预印本中处理了二进制Goppa码的情况。导言中提供了参考资料。我们提出了一个自治的治疗,也是一个复杂性分析的研究算法,这是二次的块长度$n$,当解码在相对最大解码半径的一些距离,并在$O(n^7)$时,达到最大半径。
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(山东大学密码与数字经济安全国家重点实验室)
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(南洋理工大学隐私保护技术与系统战略研究中心)
M. Zarzar,我们评估的潜力Goppa型评价码构造的线性系统上的投影代数曲面与小皮卡德数。把这个条件的皮卡德数提供了一些控制的数量不可约的组成部分的曲线在表面上,因此在最小距离的代码。我们发现,这样的表面不自动产生良好的代码,表面的截面属也有重大影响。利用这个额外的不变量,我们在超平面截面类生成Néron-Severi群的假设下推导出最小距离的界。我们还给出了几个例子,从这样的表面最小的距离比最好的知名界在Grassl的表的代码。