Back to Search
Start Over
Cayley–Bacharach and evaluation codes on complete intersections
- Source :
-
Journal of Pure & Applied Algebra . Mar2005, Vol. 196 Issue 1, p91-99. 9p. - Publication Year :
- 2005
-
Abstract
- Abstract: 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 . In this paper, we generalize Hansen''s results from to ; 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). [Copyright &y& Elsevier]
- Subjects :
- *ALGEBRA
*MATHEMATICS
*MATHEMATICAL analysis
*HYPOTHESIS
Subjects
Details
- Language :
- English
- ISSN :
- 00224049
- Volume :
- 196
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Journal of Pure & Applied Algebra
- Publication Type :
- Academic Journal
- Accession number :
- 15561087
- Full Text :
- https://doi.org/10.1016/j.jpaa.2004.08.015