Goppa and related codes invariant under a prescribed permutation

DOI10.1109/18.887871zbMath1001.94049OpenAlexW2104464473MaRDI QIDQ2705990

Thierry P. Berger

Publication date: 19 March 2001

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.887871

zbMATH Keywords

quasi-cyclic codesautomorphism groupspermutation groupalternant codesextended Goppa codes

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60) Cyclic codes (94B15)

Related Items (10)

Structural cryptanalysis of McEliece schemes with compact keys ⋮ Generalized quasi-cyclic codes with arbitrary block lengths ⋮ Cyclic Generalized Separable (L, G) Codes ⋮ Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes ⋮ Unnamed Item ⋮ 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

This page was built for publication: Goppa and related codes invariant under a prescribed permutation