Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes

DOI10.1016/J.FFA.2008.08.001MaRDI QIDQ2517815zbMATH OpenOpenAlexFDO

Authors Sudhir R. Ghorpade, Arunkumar R. Patil, Harish K. Pillai

Publication date 9 January 2009

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0710.5161

decomposable subspace exterior algebra Grassmann code Grassmann variety Griesmer-Wei bound higher weight linear code

Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50) Grassmannians, Schubert varieties, flag manifolds (14M15) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: 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.

Review text

Given integers \(\ell \leq m\) and an \(m\)-dimensional vector space \(V\) over a finite field \(F=GF(q)\), let \(G_{\ell,m}\) denote the Grassmannian of all \(\ell\)-dimensional subspaces of \(V\). This can (and will be) identified with a subspace of \(\mathbb{P}^1(\wedge^\ell V)\). Define the Grassmannian code \(C=C(\ell,m)\) to be the \([n,k]_q\) code corresponding to the projective system associated to the Plücker embedding \(G_{\ell,m}\mapsto \mathbb{P}^{k-1}(F)\), where \(n = \left[ \begin{smallmatrix} m\\ \ell \end{smallmatrix} \right]_q\) is the Gauss binomial coefficient, \(k = \left( \begin{smallmatrix} m\\ \ell \end{smallmatrix} \right)\) is the usual binomial coefficient. Define the \(r\)-th weight of \(C\) by \(d_r(C) = n-\max_{L} |L\cap G_{\ell,m}|\), where \(n\) s as above and \(L\) runs over all linear subvarieties of \(\mathbb{P}^1(\wedge^\ell V)\). Though much research has been done on these higher weights, the complete determination of them is open. The authors begin their paper with an excellent survey of the literature and then proves new results in the case \(\ell = 2\) using new techniques. A well-written paper.

Recommendations

Cites work

Cited in

(28)

This page was built for publication: Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2517815)