Schubert Varieties, Linear Codes and Enumerative Combinatorics

Details Schubert Varieties, Linear Codes and Enumerative Combinatorics Schubert Varieties, Linear Codes and Enumerative Combinatorics

2004-09-21

arxiv.org/abs/math/0409394v1

Finite Fields and their Applications, Vol. 11, No. 4 (2005), pp. 684-699.

Mathematics

Combinatorics

12 pages

Scientific paper

10.1016/j.ffa.2004.09.002

We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult questions in combinatorics and algebraic geometry. This is illustrated by codes associated to Schubert varieties in Grassmannians, called Schubert codes, which have recently been studied. The basic parameters such as the length, dimension and minimum distance of these codes are known only in special cases. An upper bound for the minimum distance is known and it is conjectured that this bound is achieved. We give explicit formulae for the length and dimension of arbitrary Schubert codes and prove the minimum distance conjecture in the affirmative for codes associated to Schubert divisors.

Affiliated with

Also associated with

No associations

Rating

Schubert Varieties, Linear Codes and Enumerative Combinatorics 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 Schubert Varieties, Linear Codes and Enumerative Combinatorics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Schubert Varieties, Linear Codes and Enumerative Combinatorics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-327947