arXiv · 1111.0356
Toric complete intersection codes
Abstract
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.
Explore related subjects
Keep this discovery
Ivan Soprunov. 2011-11-02. Toric complete intersection codes. https://doi.org/10.1016/j.jsc.2012.08.006
Cite the original work for its findings. Save a collection to share your selection of sources.