Improving the minimum distance bound of trace Goppa codes
From MaRDI portal
Publication:6109703
DOI10.1007/s10623-023-01216-6zbMath1530.94067arXiv2201.03741OpenAlexW4366777507MaRDI QIDQ6109703
Fernando Piñero-González, Ryan Lynch, Natalie Dodson, Isabel Byrne, Eric Pabón-Cancel
Publication date: 28 July 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.03741
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cites Work
- Unnamed Item
- New identities relating wild Goppa codes
- Proof of conjectures on the true dimension of some binary Goppa codes
- New quantum codes from CSS codes
- Goppa codes
- A [55,16,19 binary Goppa code (Corresp.)]
- Chain of Separable Binary Goppa Codes and Their Minimal Distance
- Further results on Goppa codes and their applications to constructing efficient binary codes
- Goppa codes and trace operator
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- True dimension of some binary quadratic trace Goppa codes
This page was built for publication: Improving the minimum distance bound of trace Goppa codes