Introduction to finite fields and their applications
Introduction to finite fields and their applications
Handbook of Coding Theory
Hi-index | 0.00 |
We consider irreducible Goppa codes over Fq of length qn defined by polynomials of degree r, where q is a prime power and n, r are arbitrary positive integers. We obtain an upper bound on the number of such codes.