Counting Extended Irreducible Binary Quartic Goppa Codes of Length <inline-formula> <tex-math notation="LaTeX">2ⁿ+1 </tex-math></inline-formula>

DOI10.1109/TIT.2015.2389246MaRDI QIDQ2978723zbMATH OpenFDO

Authors John A. Ryan

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2015.2389246

Mathematics Subject Classification ID

Combinatorial codes (94B25) Bounds on codes (94B65)

Cited in

(5)

• 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}}\)
• Enumeration of Extended Irreducible Binary Goppa Codes
• Enumeration of extended irreducible binary Goppa codes of degree 2ᵐ and length 2ⁿ+1
• Counting extended irreducible Goppa codes
• Upper bound on the number of inequivalent extended binary irreducible Goppa codes

This page was built for publication: Counting Extended Irreducible Binary Quartic Goppa Codes of Length <inline-formula> <tex-math notation="LaTeX">$2^{n}+1$ </tex-math></inline-formula>

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978723)