Extended Irreducible Binary Sextic Goppa codes

2021/09/28 by Huang, Daitao, Yue, Qin · 1 citation
#11T71 #FOS: Computer and information sciences #H.1.1 #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2109.13413

Abstract

Let n (>3) be a prime number and \Bbb F_2ⁿ a finite field of 2ⁿ elements. Let L =\Bbb F_2ⁿ∪ \∞\ be the support set and g(x) an irreducible polynomial of degree 6 over \Bbb F_2ⁿ. In this paper, we obtain an upper bound on the number of extended irreducible binary Goppa codes Γ(L, g) of degree 6 and length 2ⁿ+1.

Cited by

• Minimum Distances of Binary Goppa Codes and Constructions with Prescribed Alternating Automorphism Groups

Related

• The number of extended irreducible binary Goppa codes
• Enumeration of irreducible and extended irreducible Goppa codes
• Counting Extended Irreducible Goppa Codes
• Enumeration of extended irreducible binary Goppa codes
• Binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes