Toric complete intersection codes
classification
🧮 math.AG
cs.ITmath.IT
keywords
codescompleteevaluationintersectionstoricballico-fontanariboundsconsidered
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.