2000 character limit reached
On quadratic residue codes and hyperelliptic curves
Published 20 Sep 2006 in math.CO, cs.IT, math.AG, math.IT, and math.NT | (0609562v2)
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 $p$ and all subsets S of GF(p), we have |X_S(GF(p))| < cp?
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
