Still better nonlinear codes from modular curves
| dc.creator | Elkies, Noam D. | |
| dc.date | 2003-08-05 | |
| dc.date.accessioned | 2026-07-07T08:18:14Z | |
| dc.date.available | 2026-07-07T08:18:14Z | |
| dc.description | We give a new construction of nonlinear error-correcting codes over suitable finite fields k from the geometry of modular curves with many rational points over k, combining two recent improvements on Goppa's construction. The resulting codes are asymptotically the best currently known. | |
| dc.description | 10 pages | |
| dc.identifier | https://arxiv.org/abs/math/0308046 | |
| dc.identifier | http://arxiv.org/abs/math/0308046 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134359 | |
| dc.subject | Number Theory | |
| dc.subject | Information Theory | |
| dc.subject | Algebraic Geometry | |
| dc.subject | 94B27; 94B65 | |
| dc.title | Still better nonlinear codes from modular curves | |
| dc.type | text |