[HTML][HTML] Cayley–Bacharach and evaluation codes on complete intersections
L Gold, J Little, H Schenck�- Journal of Pure and Applied Algebra, 2005 - Elsevier
L Gold, J Little, H Schenck
Journal of Pure and Applied Algebra, 2005•ElsevierHansen (Appl. Algebra Eng. Comm. Comput. 14 (2003) 175) uses cohomological methods
to find a lower bound for the minimum distance of an evaluation code determined by a
reduced complete intersection in P2. In this paper, we generalize Hansen's results from P2
to Pm; we also show that the hypotheses of Hansen (2003) may be weakened. The proof is
succinct and follows by combining the Cayley–Bacharach Theorem and the bounds on
evaluation codes obtained in Hansen (Zero-Dimensional Schemes (Ravello, 1992), de�…
to find a lower bound for the minimum distance of an evaluation code determined by a
reduced complete intersection in P2. In this paper, we generalize Hansen's results from P2
to Pm; we also show that the hypotheses of Hansen (2003) may be weakened. The proof is
succinct and follows by combining the Cayley–Bacharach Theorem and the bounds on
evaluation codes obtained in Hansen (Zero-Dimensional Schemes (Ravello, 1992), de�…
Hansen (Appl. Algebra Eng. Comm. Comput. 14 (2003) 175) uses cohomological methods to find a lower bound for the minimum distance of an evaluation code determined by a reduced complete intersection in P2. In this paper, we generalize Hansen's results from P2 to Pm; we also show that the hypotheses of Hansen (2003) may be weakened. The proof is succinct and follows by combining the Cayley–Bacharach Theorem and the bounds on evaluation codes obtained in Hansen (Zero-Dimensional Schemes (Ravello, 1992), de Gruyter, Berlin, 1994, pp. 205–211).
Elsevier