Upper bound on the number of inequivalent extended binary irreducible Goppa codes
From MaRDI portal
Publication:6080168
DOI10.1016/J.DISC.2023.113703OpenAlexW4387029943MaRDI QIDQ6080168FDOQ6080168
Authors: Daitao Huang, Qin Yue
Publication date: 30 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113703
Recommendations
Cites Work
- On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes
- Goppa and related codes invariant under a prescribed permutation
- Title not available (Why is that?)
- Counting Extended Irreducible Binary Quartic Goppa Codes of Length <inline-formula> <tex-math notation="LaTeX">$2^{n}+1$ </tex-math></inline-formula>
- Enumeration of extended irreducible binary Goppa codes of degree \(2^m\) and length \(2^n+1\)
- Symmetries of binary Goppa codes (Corresp.)
- New classes of cyclic extended Goppa codes
- New binary codes from extended Goppa codes
- Enumeration of Extended Irreducible Binary Goppa Codes
- Extended classical Goppa codes
- Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes
- Counting extended irreducible Goppa codes
- Extended Irreducible Binary Sextic Goppa Codes
This page was built for publication: Upper bound on the number of inequivalent extended binary irreducible Goppa codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080168)