Enumeration of inequivalent irreducible Goppa codes

We consider irreducible Goppa codes over FqFq of length qnqn defined by polynomials of degree r, where q   is a prime power and n,rn,r are arbitrary positive integers. We obtain an upper bound on the number of such codes.