Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields

Details Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields

2010-01-09

arxiv.org/abs/1001.1448v3

Finite Fields Appl. 17 (2011), no. 1, 81-104

Mathematics

Commutative Algebra

Finite Fields Appl., to appear

Scientific paper

Let K be a finite field with q elements and let X be a subset of a projective space P^{s-1}, over the field K, which is parameterized by Laurent monomials. Let I(X) be the vanishing ideal of X. Some of the main contributions of this paper are in determining the structure of I(X) and some of their invariants. It is shown that I(X) is a lattice ideal. We introduce the notion of a parameterized code arising from X and present algebraic methods to compute and study its dimension, length and minimum distance. For a parameterized code arising from a connected graph we are able to compute its length and to make our results more precise. If the graph is non-bipartite, we show an upper bound for the minimum distance. We also study the underlying geometric structure of X.

Affiliated with

Also associated with

No associations

Rating

Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields 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 Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-128049