Linkage and codes on complete intersections (Q1413661): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:54, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linkage and codes on complete intersections |
scientific article |
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
