Cayley-Bacharach and evaluation codes on complete intersections

Simple item page
dc.creatorGold, Leah
dc.creatorLittle, John
dc.creatorSchenck, Hal
dc.date2003-11-09
dc.date2005-02-10
dc.date.accessioned2026-07-07T08:18:15Z
dc.date.available2026-07-07T08:18:15Z
dc.descriptionIn recent work, J. Hansen uses cohomological methods to find a lower bound for the minimum distance of an evaluation code determined by a reduced complete intersection in the projective plane. In this paper, we generalize Hansen's results from P^2 to P^m; we also show that the hypotheses in Hansen's work may be weakened. The proof is succinct and follows by combining the Cayley-Bacharach theorem and bounds on evaluation codes obtained from reduced zero-schemes.
dc.description10 pages. v2: minor expository changes
dc.identifierhttps://arxiv.org/abs/math/0311129
dc.identifierhttp://arxiv.org/abs/math/0311129
dc.identifierJ. Pure Applied Algebra 196 (2005) 91-99
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134367
dc.subjectAlgebraic Geometry
dc.subjectInformation Theory
dc.subjectCommutative Algebra
dc.subject14G50 (Primary) 94B27 (Secondary)
dc.titleCayley-Bacharach and evaluation codes on complete intersections
dc.typetext

Files

Collections

arXiv