Grassmann Codes Overview

• Grassmann codes are linear projective codes derived from finite Grassmannians using the Plücker embedding, featuring precise parameters such as n, k, and minimum distance d = q^δ.
• They integrate multilinear algebra, projective geometry, and coding theory, enabling detailed analysis of higher weight structures, automorphism groups, and decoding methods.
• Variants including affine, symplectic, and Hermitian Grassmann codes illustrate their versatility and potential applications in advanced coding frameworks.

Grassmann codes are linear projective codes attached to finite Grassmannians through the Plücker embedding. For an $m$-dimensional vector space $V$ over $\mathbb F_q$ and $1\le \ell<m$, the Grassmannian $G_{\ell,m}$ consists of the $\ell$-dimensional subspaces of $V$, and its Plücker image inside $\mathbb P(\bigwedge^\ell V)$ forms a projective system whose associated code is denoted $C(\ell,m)$. With $V=\mathbb F_q^m$, one has

$V$0

where $V$1 is the Gaussian binomial coefficient, and $V$2 is a linear $V$3-code with minimum distance

$V$4

The subject lies at the intersection of multilinear algebra, projective geometry, and coding theory, and it has generated a substantial literature on higher weights, automorphisms, decoding, and polar or affine variants (0710.5161).

1. Classical construction and basic structure

A nonzero vector $V$5 is decomposable if

$V$6

for some $V$7. The Grassmannian $V$8 is the variety of $V$9-dimensional subspaces of $\mathbb F_q$0, and the Plücker embedding sends an $\mathbb F_q$1-plane $\mathbb F_q$2 to the point of $\mathbb F_q$3 represented by $\mathbb F_q$4. Accordingly, the image of $\mathbb F_q$5 is exactly the projectivized locus of decomposable $\mathbb F_q$6-vectors (0710.5161).

Over $\mathbb F_q$7, choosing representatives $\mathbb F_q$8 of the $\mathbb F_q$9-rational Plücker points gives the evaluation model

$1\le \ell<m$0

using the canonical perfect pairing

$1\le \ell<m$1

Since the Plücker embedding is nondegenerate, $1\le \ell<m$2 is injective, and $1\le \ell<m$3 is defined as its image. In this model, minimum-weight codewords are characterized exactly by decomposability: the minimum distance is $1\le \ell<m$4, codewords $1\le \ell<m$5 with $1\le \ell<m$6 decomposable attain this weight, and

$1\le \ell<m$7

while the number of minimum-weight codewords is

$1\le \ell<m$8

Thus the smallest nonzero weights of Grassmann codes are controlled by the simplest multilinear objects in $1\le \ell<m$9 (0710.5161).

This construction makes Grassmann codes simultaneously projective-system codes and evaluation codes on a homogeneous variety. A plausible implication is that many of their structural properties can be reformulated either in the language of exterior algebra or in the geometry of linear sections of the Grassmannian.

2. Higher weights, decomposable subspaces, and linear sections

A central theorem in the subject is the classification of subspaces of $G_{\ell,m}$0 all of whose nonzero vectors are decomposable. For $G_{\ell,m}$1, define

$G_{\ell,m}$2

Then

$G_{\ell,m}$3

For decomposable $G_{\ell,m}$4, the sum $G_{\ell,m}$5 is decomposable exactly when the associated $G_{\ell,m}$6-spaces intersect in dimension $G_{\ell,m}$7. This local criterion leads to the structure theorem that a subspace of $G_{\ell,m}$8 is decomposable if and only if it is close, where close subspaces are of type I or type II and are given by explicit wedge-product normal forms (0710.5161).

Projectively, this means that the projective linear subspaces contained in the Plücker-embedded Grassmannian are exactly the projectivizations of close subspaces. If

$G_{\ell,m}$9

then $\ell$0 has a decomposable subspace of dimension $\ell$1 iff $\ell$2, and the maximum possible projective dimension of a linear subspace contained in the Grassmannian is

$\ell$3

This translates directly into higher-weight formulas for $\ell$4 (0710.5161).

If $\ell$5 has codimension $\ell$6, define

$\ell$7

where $\ell$8 counts Grassmann points on the section. Then

$\ell$9

For

$V$0

the first and terminal parts of the weight hierarchy are

$V$1

and

$V$2

For $V$3 and $V$4, one further higher weight beyond each end is also determined: $V$5 and

$V$6

where $V$7 and $V$8 (0710.5161).

The same work also introduces a generalized Griesmer-Wei bound. For a linear $V$9-code $\mathbb P(\bigwedge^\ell V)$0, with $\mathbb P(\bigwedge^\ell V)$1 the maximal number of minimum-weight codewords in an $\mathbb P(\bigwedge^\ell V)$2-dimensional subcode and $\mathbb P(\bigwedge^\ell V)$3 the second smallest positive weight, one has

$\mathbb P(\bigwedge^\ell V)$4

Specialized to Grassmann codes, this refined lower bound is effective because decomposable and near-decomposable subspaces control $\mathbb P(\bigwedge^\ell V)$5 in geometric terms (0710.5161).

3. Symmetry and automorphism groups

The automorphism theory of Grassmann codes is governed by Chow’s theorem on line-preserving bijections of Grassmannians. For the Plücker projective system $\mathbb P(\bigwedge^\ell V)$6,

$\mathbb P(\bigwedge^\ell V)$7

while in the balanced case

$\mathbb P(\bigwedge^\ell V)$8

The exceptional factor $\mathbb P(\bigwedge^\ell V)$9 comes from the Hodge-star duality when $C(\ell,m)$0 (Ghorpade et al., 2012).

At the code level, the full semilinear automorphism group is described by an explicit central extension $C(\ell,m)$1 of $C(\ell,m)$2. One has

$C(\ell,m)$3

and likewise

$C(\ell,m)$4

Thus the automorphisms of the code are precisely the semilinear symmetries of the ambient Grassmannian, together with the duality involution in the self-complementary case (Ghorpade et al., 2012).

The same geometric method yields automorphism groups for affine Grassmann codes and for Schubert divisor codes. For the big cell $C(\ell,m)$5, the relevant symmetry group is a maximal parabolic subgroup rather than the full $C(\ell,m)$6, and the permutation automorphism group of the affine Grassmann code is

$C(\ell,m)$7

This settles the permutation-group question for affine Grassmann codes and shows that Schubert divisor codes have the same full and monomial automorphism groups as affine Grassmann codes (Ghorpade et al., 2012).

4. Decoding theory and algorithmic constructions

Two distinct decoding paradigms have been developed for Grassmann codes. The first is majority logic decoding based on point-line incidence. For the dual code $C(\ell,m)$8, the minimum distance is $C(\ell,m)$9, and the support of a minimum-weight dual codeword consists of three points on a line in $V=\mathbb F_q^m$0; conversely, any three points on a line support such a codeword. This identifies lines in the Grassmannian with weight-$V=\mathbb F_q^m$1 parity checks (Beelen et al., 2020).

Fixing a point $V=\mathbb F_q^m$2 and a complete flag through $V=\mathbb F_q^m$3, every point $V=\mathbb F_q^m$4 of the Grassmannian determines a unique canonical path from $V=\mathbb F_q^m$5 to $V=\mathbb F_q^m$6 among paths with strictly decreasing $V=\mathbb F_q^m$7-tuple and strictly increasing $V=\mathbb F_q^m$8-tuple. These canonical paths are then used to construct, for each $V=\mathbb F_q^m$9, a family $V$00 of parity checks orthogonal on the coordinate $V$01, with

$V$02

Taking

$V$03

one obtains one-step majority logic decoding up to

$V$04

errors. The construction gives explicit parity checks orthogonal on every coordinate and leads to a quadratic-time majority logic decoder in the block length (Beelen et al., 2020).

A second decoder is specific to $V$05. Using the action of $V$06 on $V$07, the Grassmannian decomposes into multiplicative orbits. Projecting $V$08 onto an orbit $V$09 gives a code $V$10 that is a subcode of a Reed-Solomon code over $V$11. For many such orbits, the projection already contains an information set of the parent Grassmann code. The resulting orbit-projection decoder combines a modified Peterson procedure on the projected code with information-set lifting, and for $V$12 it corrects up to

$V$13

errors for $V$14, where

$V$15

This reaches the full unique-decoding radius for $V$16 (Piñero et al., 2020).

5. Major variants and extensions

Affine Grassmann codes are obtained by evaluating linear combinations of minors of a generic $V$17 matrix on the full affine matrix space $V$18, with

$V$19

They have parameters

$V$20

and may be viewed as variants of generalized Reed-Muller codes that are closely related to Grassmann codes. Their level-$V$21 versions satisfy

$V$22

their duals are described explicitly by non-forbidden reduced monomials and binomials, and

$V$23

apart from trivial edge cases. Both $V$24 and the full dual $V$25 are generated by their minimum-weight codewords [(0911.1298); (Beelen et al., 2011)].

Symplectic Grassmann codes $V$26 arise from the Plücker embedding of the symplectic Grassmannian $V$27 of totally isotropic $V$28-subspaces in a $V$29-dimensional symplectic space. Their parameters are

$V$30

For the line case $V$31,

$V$32

and for the Lagrangian case $V$33,

$V$34

Lagrangian-Grassmannian codes are therefore a special class of Symplectic Grassmann codes rather than a separate species (Cardinali et al., 2015).

Line Hermitian Grassmann codes are defined from the Plücker image of the totally isotropic lines of a non-degenerate Hermitian polar space over $V$35. They are subcodes of the Grassmann codes associated to the $V$36-Grassmannian. Their dimension is

$V$37

their length is

$V$38

and the minimum distance is

$V$39

Minimum-weight codewords are characterized geometrically via radicals of alternating forms and Hermitian cones, except for the exceptional small case $V$40 (Cardinali et al., 2017).

Affine Hermitian Grassmann codes $V$41 evaluate minors of a generic Hermitian $V$42 matrix on the affine space of Hermitian matrices over $V$43. They have parameters

$V$44

the same length and dimension as the comparable affine Grassmann code, but a larger minimum distance. Their duals have minimum distance

$V$45

The proof introduces Hermitian-specific notions such as spread of a minor and spread-reduction via Hermitian congruence automorphisms (González et al., 2021).

6. Related frameworks and terminological distinctions

The term “Grassmann codes” is frequently used alongside several adjacent but distinct notions. One line of work studies projective or non-degenerate linear $V$46-codes as vertices of the Grassmann graph of $V$47-subspaces of $V$48. In that setting, the central objects are induced subgraphs such as $V$49 for projective codes or $V$50 for non-degenerate codes, and the main questions concern connectedness, geodesics, isometric embedding, and rigidity of graph embeddings. These are Grassmannian coding-theory problems, but they are not classical Grassmann codes in the Plücker-evaluation sense (Kwiatkowski et al., 2017, Pankov, 2022, Cardinali et al., 2020, Cardinali et al., 2023).

A second nearby tradition studies codes in the Grassmannian, meaning constant-dimension subspace codes. Here a Grassmannian code is simply a subset of $V$51, and lifting MRD matrix codes produces families such as

$V$52

that meet the anticode bound when $V$53 or $V$54. Frobenius and cyclic-shift automorphisms have likewise been used to search for parallelisms and Steiner structures in the Grassmannian. This usage belongs to subspace coding rather than to the linear projective codes $V$55 [(Hernandez et al., 2015); (Etzion et al., 2012)].

A third, analytically different meaning appears in coding on complex Grassmann manifolds equipped with the chordal distance. There the codewords are $V$56-dimensional subspaces of $V$57, the relevant notions are density, kissing radius, hyperspherical-cap approximations, and Hamming-type bounds, and maximizing minimum distance is not equivalent to maximizing density. This is a manifold-packing theory rather than a finite-field Plücker-evaluation theory (Pitaval et al., 2016).

These distinctions are substantial. In the strict classical sense, Grassmann codes are the finite-field projective codes $V$58 arising from the Plücker embedding of $V$59. The broader literature extends the geometry of Grassmannians in several directions—affine, polar, graph-theoretic, subspace-coding, and asymptotic differential-geometric—but those developments remain anchored in the same basic insight: the Grassmannian is simultaneously a parameter space of subspaces, a projective variety defined by decomposability, and a fertile source of structured codes.