Two classes of quasi-cyclic codes via irreducible polynomials
From MaRDI portal
Publication:6107459
DOI10.1007/s12095-023-00629-3zbMath1526.94057MaRDI QIDQ6107459
Fengwei Li, Daitao Huang, Qin Yue
Publication date: 3 July 2023
Published in: Cryptography and Communications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-twisted codes with constacyclic constituent codes
- Generalized quasi-cyclic codes over Galois rings: structural properties and enumeration
- Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets
- 1-generator generalized quasi-cyclic codes over \(\mathbb {Z}_{4}\)
- Structural properties and enumeration of 1-generator generalized quasi-cyclic codes
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes
- On self-dual negacirculant codes of index two and four
- 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
- A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
- Equivalent irreducible Goppa codes (Corresp.)
- New ternary quasi-cyclic codes with better minimum distances
- On the algebraic structure of quasi-cyclic codes .I. Finite fields
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- New classes of cyclic extended Goppa codes
- Extended Irreducible Binary Sextic Goppa Codes
- ℤ₂ℤ₄-Additive Quasi-Cyclic Codes
- How Many Weights Can a Quasi-Cyclic Code Have?
This page was built for publication: Two classes of quasi-cyclic codes via irreducible polynomials
