arXiv Analytics

Sign in

arXiv:math/0308046 [math.NT]AbstractReferencesReviewsResources

Still better nonlinear codes from modular curves

Noam D. Elkies

Published 2003-08-05Version 1

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.

Related articles: Most relevant | Search more
arXiv:2101.01862 [math.NT] (Published 2021-01-06)
Quadratic Chabauty for modular curves: Algorithms and examples
arXiv:math/0403548 [math.NT] (Published 2004-03-31)
Remarks on codes from modular curves: MAGMA applications
arXiv:math/0104115 [math.NT] (Published 2001-04-10)
Excellent nonlinear codes from modular curves