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}}\) (Q470971): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q59049211, #quickstatements; #temporary_batch_1707216511891 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59049211 / rank | |||
Normal rank |
Revision as of 12:02, 6 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | 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}}\) |
scientific article |
Statements
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}}\) (English)
0 references
13 November 2014
0 references
Summary: The problem of finding the number of irreducible monic polynomials of degree \(r\) over \(\mathbb F_{q^{n}}\) is considered in this paper. By considering the fact that an irreducible polynomial of degree \(r\) over \(\mathbb F_{q^{n}}\) has a root in a subfield \(\mathbb F_{q^{s}}\) of \(\mathbb F_{q^{nr}}\) if and only if \((nr/s,r) = 1\), we show that Gauss's formula for the number of monic irreducible polynomials can be derived by merely considering the lattice of subfields of \(\mathbb F_{q^{nr}}\). We also use the lattice of subfields of \(\mathbb F_{q^{nr}}\) to determine if it is possible to generate a Goppa code using an element lying in a proper subfield of \(\mathbb F_{q^{nr}}\).
0 references