On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes

DOI10.1006/FFTA.2000.0277MaRDI QIDQ1587774zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

extensions of Goppa codesinduced-cyclic Goppa codessemilinear transformation

Mathematics Subject Classification ID

Cyclic codes (94B15) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Review text

Let \(K\) be an extension field of a prime finite field. A semilinear transformation on \(K^n\) is the action of a permutation of coordinates in \(K^n\) followed by an automorphism of the field \(K\). An induced-cyclic code is a code for which the cyclic property comes from a semilinear transformation. The paper contains the determination of all induced-cyclic Goppa codes. It also gives a necessary and sufficient condition for a Goppa code to have an induced-cyclic extension. Extensions of Goppa codes are shown to be alternant codes.

Recommendations

• scientific article; zbMATH DE number 1498784
• Further results about the cyclicity of generalized Goppa codes
• Which extended Goppa codes are cyclic?
• New classes of cyclic extended Goppa codes
• On extending Goppa codes to cyclic codes (Corresp.)

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1222357 (Why is no real title available?)
• The automorphism groups of Reed-Solomon codes
• Which extended Goppa codes are cyclic?

Cited in

(21)

• Further results about the cyclicity of generalized Goppa codes
• Which extended Goppa codes are cyclic?
• Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes
• A new subclass of cyclic Goppa codes
• Structural cryptanalysis of McEliece schemes with compact keys
• Goppa and related codes invariant under a prescribed permutation
• Cyclic Generalized Separable (L, G) Codes
• scientific article; zbMATH DE number 4068784 (Why is no real title available?)
• scientific article; zbMATH DE number 1222357 (Why is no real title available?)
• scientific article; zbMATH DE number 1498784 (Why is no real title available?)
• New classes of cyclic extended Goppa codes
• Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets
• Counting extended irreducible 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
• Factorization of invariant polynomials under actions of projective linear groups and its applications in coding theory
• Generator polynomials of cyclic expurgated or extended Goppa codes with odd characteristic
• Non-binary expurgated and extended Goppa codes with dihedral or 4-th alternating automorphism groups
• Quasi-cyclic binary extended and expurgated Goppa codes and their parameters
• On breaking McEliece keys using brute force

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)