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}}\)
From MaRDI portal
Publication:470971
DOI10.1155/2014/263179zbMath1320.11119WikidataQ59049211 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
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
11T06: Polynomials over finite fields
Related Items
Cites Work