scientific article; zbMATH DE number 7124319
From MaRDI portal
Publication:5241156
zbMath1423.94180MaRDI QIDQ5241156
Kondwani Magamba, A. Musukwa, John A. Ryan
Publication date: 30 October 2019
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Bounds on codes (94B65)
Related Items (2)
Upper bound on the number of inequivalent extended binary irreducible Goppa codes ⋮ Counting extended irreducible Goppa codes
Uses Software
Cites Work
- Unnamed Item
- 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}}\)
- Goppa and related codes invariant under a prescribed permutation
- Counting Extended Irreducible Binary Quartic Goppa Codes of Length <inline-formula> <tex-math notation="LaTeX">$2^{n}+1$ </tex-math></inline-formula>
- Equivalent irreducible Goppa codes (Corresp.)
- Counting irreducible Goppa codes
- McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks
This page was built for publication:
