Minimum Schubert Codewords and Second-Minimum Grassmann Codewords

• The Grassmann code C(ℓ, m) arises from the Plücker-embedded Grassmannian of ℓ-dimensional subspaces of an m-dimensional vector space over Fq.Source: §1 · p. 1
• Schubert codes Cα(ℓ, m) are obtained from Schubert varieties by restricting the Plücker embedding to their smallest containing projective subspace.Source: §1 · p. 2
• The paper proves that every minimum-weight codeword of Cα(ℓ, m) is indexed by a decomposable element of ∧^(m−ℓ)V for arbitrary ℓ and q, settling the conjecture.Source: §1 · p. 2
• Classifying minimum-weight Schubert-codewords enables a precise classification of second-minimum Grassmann-codewords.Source: §1 · p. 3
• The indexing element has the form v1 ∧ ··· ∧ v_(m−ℓ−2) ∧ ξ, where the v_i are linearly independent and ξ is an alternating 2-vector of rank 4.Source: §1 · p. 3
• The paper’s results complete the planned characterization and enumeration of second-minimum Grassmann-codewords after prior work determined their weight.Source: §1 · p. 3

Code construction

• Grassmann and Schubert codes arise from the Fq-rational points of the Grassmannian and Schubert varieties through projective evaluation systems.The Schubert code can also be obtained by puncturing the Grassmann code outside the Schubert variety.Source: §2 · pp. 3–4

Geometric definitions

• A Schubert variety Ωα(ℓ, m) consists of ℓ-planes satisfying dim(L ∩ Ai) ≥ i along a partial flag with dim Ai = αi.When α is consecutive, the Schubert variety equals the full Grassmannian.Source: §2 · p. 4

Code parameters

• The code Cα(ℓ, m) is an [nα, kα, dα] linear code with minimum distance dα = q^δ(α).Here δ(α) is defined from the dimension sequence α.Source: §2 · pp. 4–5

Exterior-algebra notation

• For f ∈ ∧^{m−ℓ}V, the annihilator Vf is a subspace of V, with dim Vf ≤ m−ℓ and equality exactly when f is completely decomposable.The annihilator notation is used to formulate Schubert decomposability.Source: §2 · p. 5

Minimum-weight characterization

• An element f is Schubert decomposable when it is completely decomposable and satisfies dim(Vf ∩ Api) = αpi − pi for every block boundary.The paper studies the conjecture that minimum-weight Schubert-code codewords are precisely those indexed by Schubert decomposable elements.Source: §2 · p. 5

Proof tools

• The preliminary lemmas partition supports according to the flag subspace Aℓ−1 and bound fibers of a natural projection, preparing the minimum-weight classification argument.These estimates are used repeatedly in the later inductive proof.Source: §2 · p. 6

Exterior decomposition

• The decomposition f = eαℓ ∧ f1 + f2 is evaluated separately on planes contained in Aℓ−1 and planes outside it.The term f2 vanishes on the relevant Schubert points because eαℓ belongs to E and f ∧ eαℓ evaluates to zero in the truncated code.Source: §3 · pp. 8–9

Inductive classification

• When t ≥ 2, the exterior component f1 defines a nonzero minimum-weight codeword in a smaller Schubert code Cα′′(ℓ, m − 1).The proof establishes t = ℓ − k before concluding that cf1 has minimum weight.Source: §3 · pp. 9–10
• The proof reduces minimum-weight codewords indexed by f to decomposable vectors by induction on m + ℓ.The cases are organized using t = codimAℓE, with the t = 1 case handled through an inductive restriction.Source: §3 · p. 10

Main theorem

• Theorem 3.4 states that every minimum-weight codeword of Cα(ℓ, m) equals ch for some decomposable h ∈ ∧^{m−ℓ}V.This completes the key decomposability step for non-consecutive α.Source: §3 · p. 10

Inductive classification

• The induction combines decomposable representatives with annihilator and support arguments to construct a decomposable h satisfying cf = ch.The t = 1 case uses a basis adapted to E and expresses the relevant representative through h ∧ x.Source: §3 · pp. 10–11

Main theorem

• Combining Theorem 3.4 with the prior converse gives c minimum weight if and only if c = ch for a Schubert decomposable h.An enumeration of Schubert decomposable elements therefore yields the number of minimum-weight codewords.Source: §3 · p. 12

Motivation

• Computing the Grassmann code weight spectrum is difficult, and classifying second-minimum codewords requires minimum-weight Schubert-code classifications.The paper uses this classification as the basis for its Grassmann-code characterization.Source: §4 · p. 12

Characterization

• For a second-minimum codeword, there exist linearly independent v1, …, v_{m−ℓ−2} and a rank-4 alternating 2-vector ξ such that its index has the form v1 ∧ ··· ∧ v_{m−ℓ−2} ∧ ξ.This is the necessary structural characterization established in Theorem 4.1.Source: §4 · pp. 13, 15

Proof strategy

• The proof proceeds by induction on m + ℓ, with the base case m = 4 and ℓ = 2 supplied by Nogin’s result.The induction analyzes whether a hyperplane contains the relevant Grassmannian section.Source: §4 · pp. 13–14
• The hyperplane case reduces the problem to a second-minimum codeword in a smaller Grassmann code, yielding the same decomposable-factor and rank-4 structure by induction.When G(ℓ,W) is contained in the zero set, the index lies in the exterior power of W and induction applies.Source: §4 · pp. 13–14
• The complementary case restricts to a minimum-weight codeword on a hyperplane, whose decomposable structure leads to a Schubert code and then to the rank-4 form.The argument uses the minimum-weight Schubert-code classification and shows that ξ cannot be decomposable.Source: §4 · pp. 14–15

Converse

• Conversely, every index formed from m−ℓ−2 independent vectors and a rank-4 alternating 2-vector produces a second-minimum-weight codeword.Theorem 4.3 establishes the converse, completing the characterization.Source: §4 · pp. 15–16

Enumeration

• The paper then uses this classification to enumerate all Grassmann-code codewords with weight q^{ℓ(m−ℓ)}−2(q^2+1).The enumeration is stated for 2 ≤ ℓ ≤ m − 2.Source: §4 · pp. 16–17