Codes from modular curves

Abstract

One of the most interesting class of curves, from the perspective of arithmetical algebraic geometry, are the so-called modular curves. Some of the most remarkable applications of algebraic geometry to coding theory arise from these modular curves. It turns out these algebraic-geometric codes (“AG codes”) constructed from modular curves can have parameters which beat the Gilbert–Varshamov lower bound if the ground field is sufficiently large.