Enumeration of inequivalent irreducible Goppa codes

  • Authors:

  • John A. Ryan;Patrick Fitzpatrick

  • Affiliations:

  • Department of Mathematics, Mzuzu University, P/Bag 201, Luwinga, Mzuzu 2, Malawi;Boole Centre for Research in Informatics, University College Cork, Cork, Ireland

  • Venue:
  • Discrete Applied Mathematics - Special issue: Coding and cryptography
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider irreducible Goppa codes over F"q 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.