#### Filter Results:

#### Publication Year

2001

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We consider irreducible Goppa codes over Fq of length q n 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.

- ‹
- 1
- ›