Enumeration of inequivalent irreducible Goppa codes Original Research Article

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