arXiv · math/0311129
Cayley-Bacharach and evaluation codes on complete intersections
Abstract
In 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.
Explore related subjects
Keep this discovery
Leah Gold, John Little, Hal Schenck. 2005-02-10. Cayley-Bacharach and evaluation codes on complete intersections. https://arxiv.org/abs/math/0311129
Cite the original work for its findings. Save a collection to share your selection of sources.