| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420889 | Discrete Applied Mathematics | 2006 | 14 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
John A. Ryan, Patrick Fitzpatrick,