Cayley-Bacharach and evaluation codes on complete intersections
<|reference_start|>Cayley-Bacharach and evaluation codes on complete intersections: 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.<|reference_end|>
@article{gold2003cayley-bacharach,
    title={Cayley-Bacharach and evaluation codes on complete intersections},
    author={Leah Gold, John Little, Hal Schenck},
    journal={J. Pure Applied Algebra 196 (2005) 91-99},
    year={2003},
    archivePrefix={arXiv},
    eprint={math/0311129},
    primaryClass={math.AG cs.IT math.AC math.IT}
}