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.0277zbMath0965.94025OpenAlexW2078870121MaRDI QIDQ1587774
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
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Cyclic codes (94B15)
Related Items (9)
Structural cryptanalysis of McEliece schemes with compact keys ⋮ Cyclic Generalized Separable (L, G) Codes ⋮ Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes ⋮ Two classes of cyclic extended double-error-correcting Goppa codes ⋮ Upper bound on the number of inequivalent extended binary irreducible Goppa codes ⋮ Two classes of quasi-cyclic codes via irreducible polynomials ⋮ Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets ⋮ A new subclass of cyclic Goppa codes ⋮ Counting extended irreducible Goppa codes
Cites Work
This page was built for publication: On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes