Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T00:27:22.630Z Has data issue: false hasContentIssue false

Counting irreducible Goppa codes

Published online by Cambridge University Press:  09 April 2009

Patrick Fitzpatrick
Affiliation:
Department of Mathematics, University College Cork, Ireland e-mail: fitzpat@ucc.ie
John A. Ryan
Affiliation:
Department of Mathematics, Mzuzu University, Malawi, e-mail: mzuzu_jar@oceanfree.net
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2001