Linkage and codes on complete intersections (Q1413661)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linkage and codes on complete intersections |
scientific article; zbMATH DE number 2004989
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linkage and codes on complete intersections |
scientific article; zbMATH DE number 2004989 |
Statements
Linkage and codes on complete intersections (English)
0 references
17 November 2003
0 references
The paper introduces cohomological methods in the theory of error-correcting codes. In particular the author considers evaluation codes on a complete intersection. Also by way of linkage of subschemes, a lower bound for the minimal distance is obtained.
0 references
liason
0 references
linkage
0 references
complete intersections
0 references
error-correcting codes
0 references
