Table of Contents
Journal of Discrete Mathematics
Volume 2014, Article ID 263179, 4 pages
Research Article

Counting Irreducible Polynomials of Degree over and Generating Goppa Codes Using the Lattice of Subfields of

1Malawi Institute of Technology, Malawi University of Science and Technology, P.O. Box 5196, Limbe, Malawi
2Department of Mathematics, Mzuzu University, Private Bag 201, Luwinga, Mzuzu, Malawi

Received 28 May 2014; Accepted 8 September 2014; Published 18 September 2014

Academic Editor: Jean-Pierre Gazeau

Copyright © 2014 Kondwani Magamba and John A. Ryan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. F. Gauss, Untersuchungen Über Höhere Arithmetik, Chelsea Publishing, New York, NY, USA, 2nd edition, 1981.
  2. S. K. Chebolu and J. Mináč, “Counting irreducible polynomials over finite fields using the inclusion-exclusion principle,” Mathematics Magazine, vol. 84, no. 5, pp. 369–371, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications, Cambridge University Press, Cambridge, UK, 1994.
  4. J. A. Ryan and P. Fizpatrick, “Enumeration of inequivalent irreducible Goppa codes,” Discrete Applied Mathematics, vol. 154, no. 2, pp. 399–412, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. K. H. Rosen, Discrete Mathematics and Its Applications, McGraw-Hill, New York, NY, USA, 1999.
  6. C. L. Chen, “Equivalent irreducible Goppa codes,” IEEE Transactions on Information Theory, vol. 24, no. 6, pp. 766–769, 1978. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus