Abstract
Here we apply the so-called Horace method for zero-dimensional schemes to error-correcting codes on complete intersections. In particular, we obtain sharper estimates on the minimum distance.
Similar content being viewed by others
References
Duursma I.M., Rentería C., Tapia-Recillas H. (2001). Reed-Muller codes on complete intersections. Appl Algebra Eng Comm Comput 11:455–462
Eisenbud D., Green M., Harris J. (1996). Cayley–Bacharach theorems and conjectures. Bull Am Math Soc (N.S.) 33:295–324
Gold L., Little J., Schenck H. (2005). Cayley–Bacharach and evaluation codes on complete intersections. J Pure Appl Algebra 196:91–99
Hansen J.P. (1994). Points in uniform position and maximum distance separable codes Zero-dimensional schemes (Ravello, 1992). de Gruyter, Berlin pp 205–211
Hansen J.P. (2003). Linkage and codes on complete intersections. Appl Algebra Eng Comm Comput 14:175–185
Hartshorne R. (1977). Algebraic geometry. Graduate texts in mathematics, vol. 52. Springer, Berlin Heidelberg New York
Hefez A. Kleiman S.L. (1985). Notes on the duality of projective varieties. Geometry today (Rome, 1984), Progress in Mathematics, vol 60. Birkhäuser, Boston, pp143–183
Hirschowitz A. (1985). La méthode d’Horace pour l’interpolation à plusieurs variables. Manuscripta Math 50:337–388
Migliore J.C. (1998). Introduction to liaison theory and deficiency modules. Progress in Mathematics, vol. 165, Birkhäuser, Boston
Rathmann J. (1987). The uniform position principle for curves in characteristic p. Math Ann 276:565–579
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ballico, E., Fontanari, C. The Horace Method for Error-Correcting Codes. AAECC 17, 135–139 (2006). https://doi.org/10.1007/s00200-006-0012-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-006-0012-y