Abstract
In this paper, we always assume that p and n>3 are two distinct odd primes, m≥2 is a positive integer, and gcd(pm,2n(22n−1))≠1. Set r=p2 or r=p3, we determine upper bounds on the number of inequivalent extended binary irreducible Goppa codes Γ(L,g) of degree r and length 2n+1, where L=F2n∪{∞} is the support set and each g(x) is an irreducible polynomial of degree r over F2n.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
