Enumeration of extended irreducible binary Goppa codes of degree 2ᵐ and length 2ⁿ+1
From MaRDI portal
Publication:5241156
Recommendations
Cites work
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- Counting Extended Irreducible Binary Quartic Goppa Codes of Length <inline-formula> <tex-math notation="LaTeX">$2^{n}+1$ </tex-math></inline-formula>
- Counting irreducible Goppa codes
- 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}}\)
- Equivalent irreducible Goppa codes (Corresp.)
- Goppa and related codes invariant under a prescribed permutation
- McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks
Cited in
(8)- Enumeration of inequivalent irreducible Goppa codes
- Counting extended irreducible Goppa codes
- 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}}\)
- The number of inequivalent irreducible Goppa codes
- Enumeration of Extended Irreducible Binary Goppa Codes
- Upper bound on the number of inequivalent extended binary irreducible Goppa codes
- Interesting examples on maximal irreducible Goppa codes
- Counting irreducible Goppa codes
This page was built for publication: Enumeration of extended irreducible binary Goppa codes of degree \(2^m\) and length \(2^n+1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241156)
