Paperlane

no. 5 · Friday 30 October 2026

Towards the characterization of minimum weight codewords of Schubert codes

Mrinmoy Datta, Tiasa Dutta and Trygve Johnsen

math.CO · v2

Abstract

A formula for the minimum weight of Schubert codes was conjectured by Ghorpade and Lachaud in 2000. This was established by Xiang in 2008. In 2018, Ghorpade and Singh provided a new proof of this conjecture. Moreover, they also conjectured that the minimum weight codewords of the Schubert codes $C_\a (\ell, m)$ are given by the so-called \emph{Schubert decomposable codewords}. We prove the validity of the conjecture for all Schubert varieties $Ω_{\a}(\ell, V_m)$ for all but finitely many values of $q$.

fields
Combinatorics
pdf ↗ page arXiv:2603.14247 ↗