arXiv (All)
open access
On True Minimum Distances of Goppa Codes
Binary Goppa codes are important in coding theory and cryptography. It is well-known that the minimum distance of a binary Goppa code defined by a squarefree polynomial of degree $r$ is at least $2r+1$. Though from the classical results of C. J. Moreno, O. Moreno, F. Levy-dit-Vehel and S. Litsyn tha
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On Optimal Encodings and Systematicity in Function-Correcting Codes#1233050
- On the hardness of approximating minimum distances of quantum codes#1199698
- A Tight Cycle-Cover Inequality for Shortest Common Superstring#1064465
- Upper Bounds for the Euclidean Operator Radius and Applications#190776
- Semidefinite programming bounds for distance distribution of spherical codes#1118357
Record · ID 1401617
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive