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

From MaRDI portal
scientific article
Language Label Description Also known as
English
Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes
scientific article

    Statements

    Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes (English)
    0 references
    0 references
    0 references
    0 references
    9 January 2009
    0 references
    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.
    0 references
    exterior algebra
    0 references
    decomposable subspace
    0 references
    Grassmann variety
    0 references
    linear code
    0 references
    higher weight
    0 references
    Griesmer-Wei bound
    0 references
    Grassmann code
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references