Resumen
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.
| Idioma original | Inglés |
|---|---|
| Número de artículo | 111962 |
| Publicación | Discrete Mathematics |
| Volumen | 343 |
| N.º | 9 |
| DOI | |
| Estado | Publicada - sept 2020 |
Huella
Profundice en los temas de investigación de 'On quaternary Goppa codes'. En conjunto forman una huella única.Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver