One of the oldest problems in coding theory is to match the Gilbert--Varshamov bound with explicit binary codes. Over larger---yet still constant-sized---fields, algebraic-geometry codes are known to beat the GV bound. In this work, we leverage this phenomenon by taking traces of AG codes. Our hope is that the margin ... more >>>