加载中…
Let be a prime number and a finite field of elements. Let be the support set and an irreducible polynomial of degree over . In this paper, we obtain an upper bound on the number of extended irreducible binary Goppa codes of degree and length .

生成讲解博客的中文版本

生成AI智能校验的中文版本