Counting irreducible Goppa codes

Patrick Fitzpatrick, John A. Ryan
2001 Journal of the Australian Mathematical Society  
We consider irreducible Goppa codes of length q m over IF, defined by polynomials of degree r, where q = p' and p, m, r are distinct primes. The number of such codes, inequivalent under coordinate permutations and field automorphisms, is determined. 2000 Mathematics subject classification: primary 94B60,11T71.
doi:10.1017/s1446788700002949 fatcat:dhoj4jcn7faivk2vbn4u3odevy