Abstract
In Goppa (1970), V. D. Goppa presents a new family of linear codes over finite fields. This family, now known as Goppa codes, has been studied for nearly 50 years, including efficient decoding algorithms (Patterson, 1975) and its applications in cryptography (McEliece, 1978). Moreover, in Andrade et al. (2005), de Andrade and Palazzo present a generalization of Goppa codes to finite rings. Motivated by cryptographic applications, in this article we focus on Goppa codes over Z∕4Z and study some of their properties.
| Original language | English |
|---|---|
| Article number | 111962 |
| Journal | Discrete Mathematics |
| Volume | 343 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - Sept 2020 |
Keywords
- Goppa codes
- McEliece cryptosystem
- Quaternary codes
Fingerprint
Dive into the research topics of 'On quaternary Goppa codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver