Related papers: Codes on Linear Sections of Grassmannians
The Grassmannian is an important object in Algebraic Geometry. One of the many techniques used to study the Grassmannian is to build a vector space from its points in the projective embedding and study the properties of the resulting linear…
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…
We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum…
In this manuscript, we introduce a new class of linear codes, called affine symplectic Grassmann codes, and determine their parameters, automorphism group, minimum distance codewords, dual code and other key features. These linear codes are…
For an arbitrary field of any characteristic we give an explicit description, in terms of Pl\"ucker coordinates, of the projective linear space that cuts out the Lagrangian-Grassmannian variety $L(n,2n)$ of maximal isotropic subspaces in a…
The Grassmannians of lines in projective N-space, G(1,N), are embedded by way of the Pl"ucker embedding in the projective space P(\bigwedge^2 C^{N+1}). Let H^l be a general l-codimensional linear subspace in this projective space. We…
Using the concept of projective systems for linear codes and elementary linear algebra, we show that projective $[n,k]_q$ codes form a connected subgraph in the Grassmann graph consisting of $k$-dimensional subspaces of an $n$-dimensional…
We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…
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…
Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on lines in PG($n,p$) or codes in the Grassmannian, to form automorphisms groups in the Grassmanian and in its codes. These automorphisms are…
Consider the Grassmann graph formed by $k$-dimensional subspaces of an $n$-dimensional vector space over the field of $q$ elements ($1<k<n-1$) and denote by $\Pi(n,k)_q$ the restriction of this graph to the set of projective $[n,k]_q$…
We classify complex projective varieties of dimension $2r \geq 8$ swept out by a family of codimension two grassmannians of lines $\mathbb{G}(1,r)$. They are either fibrations onto normal surfaces such that the general fibers are isomorphic…
We study subsets of Grassmann varieties G(l,m) over a field F, such that these subsets are unions of Schubert cycles, with respect to a fixed flag. We study the linear spans of, and in case of positive characteristic, the number of points…
AG codes correspond geometrically to points in the Grassmannian of k-planes in an n-dimensional projective space PG(n, F_q) defined over a finite field F_q of q elements. We prove that invariant subgrassmannians by the action of a triangle…
Let $\Gamma(n,k)$ be the Grassmann graph formed by the $k$-dimensional subspaces of a vector space of dimension $n$ over a field $\mathbb F$ and, for $t\in \mathbb{N}\setminus \{0\}$, let $\Delta_t(n,k)$ be the subgraph of $\Gamma(n,k)$…
In this note, we generalize the Proj-construction from usual schemes to blue schemes. This yields the definition of projective space and projective varieties over a blueprint. In particular, it is possible to descend closed subvarieties of…
Grassmannian $\mathcal{G}_q(n,k)$ is the set of all $k$-dimensional subspaces of the vector space $\mathbb{F}_q^n.$ Recently, Etzion and Zhang introduced a new notion called covering Grassmannian code which can be used in network coding…
We show that homologically projectively dual varieties for Grassmannians Gr(2,6) and Gr(2,7) are given by certain noncommutative resolutions of singularities of the corresponding Pfaffian varieties. As an application we describe the derived…
A $k$-polar Grassmannian is the geometry having as pointset the set of all $k$-dimensional subspaces of a vector space $V$ which are totally isotropic for a given non-degenerate bilinear form $\mu$ defined on $V.$ Hence it can be regarded…
This paper is a general survey of literature on Goppa-type codes from higher dimensional algebraic varieties. The construction and several techniques for estimating the minimum distance are described first. Codes from various classes of…