The minimum distance of parameterized codes on projective tori
classification
🧮 math.AC
cs.ITmath.AGmath.IT
keywords
parameterizedprojectivearisingdistanceminimumcasecluttercode
read the original abstract
Let X be a subset of a projective space, over a finite field K, which is parameterized by the monomials arising from the edges of a clutter. Let I(X) be the vanishing ideal of X. It is shown that I(X) is a complete intersection if and only if X is a projective torus. In this case we determine the minimum distance of any parameterized linear code arising from X.
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.