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 ℙ2. In this paper, we generalize Hansen's results from ℙ2 to ℙm; 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).
| Original language | English (US) |
|---|---|
| Pages (from-to) | 91-99 |
| Number of pages | 9 |
| Journal | Journal of Pure and Applied Algebra |
| Volume | 196 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 2005 |
| Externally published | Yes |
ASJC Scopus subject areas
- Algebra and Number Theory
Fingerprint
Dive into the research topics of 'Cayley-Bacharach and evaluation codes on complete intersections'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS