Extended Irreducible Binary Sextic Goppa codes
Daitao Huang, Qin Yue

TL;DR
This paper establishes an upper bound on the number of extended irreducible binary Goppa codes of degree 6 over finite fields, contributing to the understanding of their enumeration and properties.
Contribution
It provides a new upper bound on the count of extended irreducible binary Goppa codes of degree 6, advancing coding theory knowledge.
Findings
Derived an upper bound for the number of such codes
Enhanced understanding of the structure of Goppa codes
Contributed to the enumeration of irreducible Goppa codes
Abstract
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research
