Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-26T20:03:22.091Z Has data issue: false hasContentIssue false
  • English
  • Français

Counting irreducible Goppa codes

Part of: Theory of error-correcting codes and error-detecting codes Finite fields and commutative rings (number-theoretic aspects)

Published online by Cambridge University Press:  09 April 2009

Patrick Fitzpatrick  and
John A. Ryan
Patrick Fitzpatrick
Affiliation:
Department of Mathematics, University College Cork, Ireland e-mail: [email protected]
John A. Ryan
Affiliation:
Department of Mathematics, Mzuzu University, Malawi, e-mail: [email protected]
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.

Keywords

classical Goppa codesermeration

MSC classification

Secondary: 94B60: Other types of codes 11T71: Algebraic coding theory; cryptography
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]Berlekamp, E. R. and Moreno, O., ‘Extended double error correcting Goppa codes are cyclic’, IEEE Trans. Information Theory IT-19 (1973), 817–818.CrossRefGoogle Scholar
[2]Chen, C.-L., ‘Equivalent irreducible Goppa codes’, IEEE Trans. Information Theory IT—24 (1978), 766–769.CrossRefGoogle Scholar
[3]Elia, M., Taricco, G. and Viterbo, V., ‘On the classification of binary Goppa codes’, presented at ISITA, Honolulu, Nov. 2000.Google Scholar
[4]Gibson, J. K., ‘Equivalent Goppa codes and trapdoors to McEliece's public key cryptosystem’, in: Advances in Cryptology — EUROCRYPT 91 (Brighton 1991), Lecture Notes in Comput. Sci. 547 (Springer, Berlin, 1991) pp. 517–521.CrossRefGoogle Scholar
[5]Isaacs, I. M., Algebra: A graduate text (Brooks/Cole, Pacific Grove, CA, 1994).Google Scholar
[6]Lidl, R. and Niederreiter, H., Introduction to finite fields and their applications (Cambridge Univ. Press, Cambridge, 1994).CrossRefGoogle Scholar
[7]Moreno, O., ‘Symmetries of binary Goppa codes’, IEEE Trans. Information Theory IT—25 (1979), 609–612.CrossRefGoogle Scholar
[8]Pless, V. S., Huffman, W. C. and Brualdi, R. A. (eds.), Handbook of coding theory (North-Holland, Amsterdam, 1998).Google Scholar