Article contents
Counting irreducible Goppa codes
Published online by Cambridge University Press: 09 April 2009
Abstract
We consider ineducible Goppa codes of length qm over Fq defined by polynomials of degree r, where q = pt and p, m, r are distinct primes. The number of such codes, inequivalent under coordinate permutations and field automorphisms, is determined.
Keywords
MSC classification
- Type
- Research Article
- Information
- Journal of the Australian Mathematical Society , Volume 71 , Issue 3 , December 2001 , pp. 299 - 306
- Copyright
- Copyright © Australian Mathematical Society 2001
References
- 1
- Cited by