Ivan Soprunov
Published 2011-11-02, updated 2013-10-18Version 2
In this paper we give lower bounds for the minimum distance of evaluation codes constructed from complete intersections in toric varieties. This generalizes the results of Gold-Little-Schenck and Ballico-Fontanari who considered evaluation codes on complete intersections in the projective space.
Comments: 14 pages, 2 figures. Minor changes, simpler proofs, new examples
Journal: Journal of Symbolic Computation, Volume 50, (2013), Pages 374-385
On dual toric complete intersection codes
Toric surface codes and Minkowski length of polygons
A Note on Toric Varieties Associated to Moduli Spaces
![QR code for arXiv:1111.0356 [math.AG]](http://oss.arxitics.com/images/favicon.svg)