TL;DR
This paper establishes lower bounds for the minimum distance of evaluation codes derived from complete intersections in toric varieties, extending previous results from projective spaces to a broader class of algebraic varieties.
Contribution
It generalizes existing bounds on evaluation codes to the setting of toric complete intersections, broadening the scope of algebraic coding theory.
Findings
Provides new lower bounds for minimum distances of toric evaluation codes.
Extends prior results from projective spaces to toric varieties.
Enhances understanding of code parameters in algebraic geometry contexts.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.