Enumeration of inequivalent irreducible Goppa codes

DOI10.1016/j.dam.2005.03.017zbMath1091.94040OpenAlexW2024504985MaRDI QIDQ2489936

Patrick Fitzpatrick, John A. Ryan

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.03.017

zbMATH Keywords

EnumerationCauchy-Frobenius theoremClassical Goppa codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (3)

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}}\) ⋮ Counting extended irreducible Goppa codes ⋮ Counting extended irreducible Goppa codes

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symmetries of binary Goppa codes (Corresp.)
• Equivalent irreducible Goppa codes (Corresp.)
• Extended double-error-correcting binary Goppa codes are cyclic (Corresp.)
• Counting irreducible Goppa codes
• The Lattice Point Covering Theorem for Rectangles

This page was built for publication: Enumeration of inequivalent irreducible Goppa codes