An Exhaustion Bound for Algebraic-Geometric “Modular” Codes

We construct a new lower bound for asymptotic parameters of codes arising from modular curves. For $q=4,9,16,25$, it is identical to the Varshamov–Gilbert bound, whereas for $q=p^{2a}\geq 49$ it improves the best known lower bound in two ranges of $\delta$.