Counting irreducible polynomials of degree r over F_q^n and generating Goppa codes using the lattice of subfields of F_q^nr
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}}\).
- Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields (extended abstract)
- Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle
- Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields
- Counting Extended Irreducible Binary Quartic Goppa Codes of Length <inline-formula> <tex-math notation="LaTeX">$2^{n}+1$ </tex-math></inline-formula>
- Counting irreducible polynomials with prescribed coefficients over a finite field
- On the enumeration of irreducible polynomials over \(\mathrm{GF}(q)\) with prescribed coefficients
- Enumeration of extended irreducible binary Goppa codes of degree 2ᵐ and length 2ⁿ+1
- Codes over rings of size \(p^2\) and lattices over imaginary quadratic fields
- Enumeration of inequivalent irreducible Goppa codes
- Counting irreducible polynomials over finite fields
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}}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q470971)
