The minimum distance of parameterized codes on projective tori

Details The minimum distance of parameterized codes on projective tori The minimum distance of parameterized codes on projective tori

2010-09-25

arxiv.org/abs/1009.4966v3

Appl. Algebra Engrg. Comm. Comput. 22 (2011), no. 4, 249--264

Mathematics

Commutative Algebra

Appl. Algebra Engrg. Comm. Comput., to appear

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The minimum distance of parameterized codes on projective tori does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The minimum distance of parameterized codes on projective tori, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The minimum distance of parameterized codes on projective tori will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-695584