On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes
From MaRDI portal
Publication:1587774
DOI10.1006/FFTA.2000.0277zbMATH Open0965.94025OpenAlexW2078870121MaRDI QIDQ1587774FDOQ1587774
Authors: Thierry P. Berger
Publication date: 3 December 2000
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/ffta.2000.0277
Recommendations
Cyclic codes (94B15) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cites Work
Cited In (14)
- Structural cryptanalysis of McEliece schemes with compact keys
- Counting extended irreducible Goppa codes
- Cyclic Generalized Separable (L, G) Codes
- A new subclass of cyclic Goppa codes
- Title not available (Why is that?)
- Two classes of cyclic extended double-error-correcting Goppa codes
- Two classes of quasi-cyclic codes via irreducible polynomials
- Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes
- Upper bound on the number of inequivalent extended binary irreducible Goppa codes
- Goppa and related codes invariant under a prescribed permutation
- Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets
- Further results about the cyclicity of generalized Goppa codes
- Factorization of invariant polynomials under actions of projective linear groups and its applications in coding theory
- Which extended Goppa codes are cyclic?
This page was built for publication: On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587774)