Still better nonlinear codes from modular curves
<|reference_start|>Still better nonlinear codes from modular curves: 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.<|reference_end|>
@article{elkies2003still,
    title={Still better nonlinear codes from modular curves},
    author={Noam D. Elkies},
    journal={arXiv preprint arXiv:math/0308046},
    year={2003},
    archivePrefix={arXiv},
    eprint={math/0308046},
    primaryClass={math.NT cs.IT math.AG math.IT}
}