Decomposable Subspaces, Linear Sections of Grassmann Varieties, and Higher Weights of Grassmann Codes

Details Decomposable Subspaces, Linear Sections of Grassmann Varieties, and Higher Weights of Grassmann Codes Decomposable Subspaces, Linear Sections of Grassmann Varieties, and Higher Weights of Grassmann Codes

2007-10-26

arxiv.org/abs/0710.5161v1

Finite Fields Appl. 15 (2009), no. 1, 54--68.

Mathematics

Algebraic Geometry

16 pages

Scientific paper

10.1016/j.ffa.2008.08.001

Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann variety with its Plucker embedding. When the base field is finite, we consider the more general question of determining the maximum number of points on sections of Grassmannians by linear subvarieties of a fixed (co)dimension. This corresponds to a known open problem of determining the complete weight hierarchy of linear error correcting codes associated to Grassmann varieties. We recover most of the known results as well as prove some new results. In the process we obtain, and utilize, a simple generalization of the Griesmer-Wei bound for arbitrary linear codes.

Affiliated with

Also associated with

No associations

Rating

Decomposable Subspaces, Linear Sections of Grassmann Varieties, and Higher Weights of Grassmann Codes 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 Decomposable Subspaces, Linear Sections of Grassmann Varieties, and Higher Weights of Grassmann Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposable Subspaces, Linear Sections of Grassmann Varieties, and Higher Weights of Grassmann Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-192113