Counting irreducible Goppa codes
Patrick M. Fitzpatrick, John A. Ryan · Journal of the Australian Mathematical Society · 2001
Abstract We consider ineducible Goppa codes of length qm over Fq defined by polynomials of degree r, where q = pt and p, m, r are distinct primes. The number of such codes, inequivalent under coordinate permutations and field automorphisms, is determined.