Counting irreducible polynomials of degree \(r\) over \(\mathbb F_{q^n}\) and generating Goppa codes using the lattice of subfields of \(\mathbb F_{q^{nr}}\)

DOI10.1155/2014/263179zbMath1320.11119OpenAlexW2102051939WikidataQ59049211 ScholiaQ59049211MaRDI QIDQ470971

John A. Ryan, Kondwani Magamba

Publication date: 13 November 2014

Published in: Journal of Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/263179

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Polynomials over finite fields (11T06)

Related Items (2)

Unnamed Item ⋮ Counting extended irreducible Goppa codes

Cites Work

• Unnamed Item
• Enumeration of inequivalent irreducible Goppa codes
• Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle
• Equivalent irreducible Goppa codes (Corresp.)

This page was built for publication: Counting irreducible polynomials of degree \(r\) over \(\mathbb F_{q^n}\) and generating Goppa codes using the lattice of subfields of \(\mathbb F_{q^{nr}}\)