Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes

DOI10.1007/S10623-022-01062-YOpenAlexW4282572216WikidataQ114849717 ScholiaQ114849717MaRDI QIDQ2153754FDOQ2153754

Qin Yue, Xia Li

Publication date: 13 July 2022

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-022-01062-y

zbMATH Keywords

quasi-cyclic codesirreducible polynomialsprojective linear groupextended Goppa codesparity-check subcodes of Goppa codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes
• Goppa and related codes invariant under a prescribed permutation
• Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups
• Monoidic Codes in Cryptography
• Reducing Key Length of the McEliece Cryptosystem
• Compact McEliece Keys from Goppa Codes
• Compact McEliece keys based on quasi-dyadic Srivastava codes
• On the solution of algebraic equations over finite fields
• Binary quasi-cyclic Goppa codes

Cited In (3)

• Binary quasi-cyclic Goppa codes
• A Generalized Construction and Improvements on Nonbinary Codes From Goppa Codes
• Upper bound on the number of inequivalent extended binary irreducible Goppa codes

This page was built for publication: Non-binary irreducible quasi-cyclic 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 Q2153754)