On quadratic residue codes and hyperelliptic curves

Simple item page
dc.creatorJoyner, David
dc.date2006-09-20
dc.date2008-02-21
dc.date.accessioned2026-07-07T09:22:08Z
dc.date.available2026-07-07T09:22:08Z
dc.descriptionA 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?
dc.description18 pages, no figures
dc.identifierhttps://arxiv.org/abs/math/0609562
dc.identifierhttp://arxiv.org/abs/math/0609562
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155273
dc.subjectCombinatorics
dc.subjectInformation Theory
dc.subjectAlgebraic Geometry
dc.subjectNumber Theory
dc.subject94B40, 11T71, 14G15, 14G50
dc.titleOn quadratic residue codes and hyperelliptic curves
dc.typetext

Files

Collections

arXiv