On quadratic residue codes and hyperelliptic curves
Combinatorics
2008-02-21 v2 Information Theory
Algebraic Geometry
math.IT
Number Theory
Abstract
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 and all subsets S of GF(p), we have |X_S(GF(p))| < cp?
Keywords
Cite
@article{arxiv.math/0609562,
title = {On quadratic residue codes and hyperelliptic curves},
author = {David Joyner},
journal= {arXiv preprint arXiv:math/0609562},
year = {2008}
}
Comments
18 pages, no figures