Still better nonlinear codes from modular curves
Noam D. Elkies
Abstract
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.
Create a lesson
Related papers
Unit fraction representations using shifted Golomb primes
Rishika Agrawal
Improved deterministic integer factorization by quadratic-image sieving
Pantelimon Stănică
Private key sieves for improved attacks on RSA
Markus Hittmeir
Multiple q-zeta values as polynomials in partition multiplicities
Jan-Willem M. van Ittersum
Hopf-Galois Structures on Extensions Arising from Division Points on Elliptic Curves
Leolin Nkuete
Certified Collision Exclusion and an Unconditional Upper Bound Λ<0.156821 for the de Bruijn--Newman Constant
Michel Planat, Dale James Raymond