Linkage and codes on complete intersections
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.
scientific article; zbMATH DE number 2004989