Cyclic Generalized Separable (L, G) Codes
From MaRDI portal
Publication:3460448
DOI10.1007/978-3-319-17296-5_5zbMath1343.94093OpenAlexW2289330379MaRDI QIDQ3460448
Publication date: 7 January 2016
Published in: Coding Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17296-5_5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bound of covering radius of binary irreducible Goppa codes
- Which extended Goppa codes are cyclic?
- Cyclic (L,g)-codes
- On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
- Goppa and related codes invariant under a prescribed permutation
- Symmetries of binary Goppa codes (Corresp.)
- On extending Goppa codes to cyclic codes (Corresp.)
- Characterization theorems for extending Goppa codes to cyclic codes (Corresp.)
- Extended double-error-correcting binary Goppa codes are cyclic (Corresp.)
- New classes of cyclic extended Goppa codes
- Decoding Cyclic Codes up to a New Bound on the Minimum Distance
- Subclass of Cyclic Goppa Codes
This page was built for publication: Cyclic Generalized Separable (L, G) Codes