2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/155273A long standing problem has been to develop "good" binary linear codes to be used for error-correction. This paper investigates in some detail an attack on this problem using a connection between quadratic residue codes and hyperelliptic curves. One question which coding theory is used to attack is: Does there exist a c<2 such that, for all sufficiently large $p$ and all subsets S of GF(p), we have |X_S(GF(p))| < cp?18 pages, no figuresCombinatoricsInformation TheoryAlgebraic GeometryNumber Theory94B40, 11T71, 14G15, 14G50text