On quadratic residue codes and hyperelliptic curves
<|reference_start|>On quadratic residue codes and hyperelliptic curves: A 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?<|reference_end|>
@article{joyner2006on,
    title={On quadratic residue codes and hyperelliptic curves},
    author={David Joyner},
    journal={arXiv preprint arXiv:math/0609562},
    year={2006},
    archivePrefix={arXiv},
    eprint={math/0609562},
    primaryClass={math.CO cs.IT math.AG math.IT math.NT}
}