Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets
From MaRDI portal
Publication:502401
DOI10.1007/s12095-016-0196-3zbMath1380.94142OpenAlexW2460597230MaRDI QIDQ502401
Sergei V. Bezzateev, Natalia A. Shekhunova
Publication date: 5 January 2017
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-016-0196-3
Linear codes (general theory) (94B05) Bounds on codes (94B65) Other types of codes (94B60) Cyclic codes (94B15)
Related Items (2)
Two classes of quasi-cyclic codes via irreducible polynomials ⋮ Totally decomposed cumulative Goppa codes with improved estimations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Which extended Goppa codes are cyclic?
- The Magma algebra system. I: The user language
- On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes
- A new subclass of cyclic Goppa codes
- Goppa and related codes invariant under a prescribed permutation
- Chain of Separable Binary Goppa Codes and Their Minimal Distance
- Symmetries of binary Goppa codes (Corresp.)
- On extending Goppa codes to cyclic codes (Corresp.)
- Characterization theorems for extending Goppa codes to cyclic codes (Corresp.)
- Goppa codes and trace operator
- Extended double-error-correcting binary Goppa codes are cyclic (Corresp.)
- New classes of cyclic extended Goppa codes
- Some results on quasi-cyclic codes
- Algebraic Codes for Data Transmission
This page was built for publication: Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets
