Towards the characterization of minimum weight codewords of Schubert codes

arXiv:2603.14247 · math.CO · Submitted 2026-03-15 · Read on arXiv

math.CO

Submitted: 2026-03-15

Updated: 2026-10-28

License: http://creativecommons.org/licenses/by/4.0/

The gist: A formula for the minimum weight of Schubert codes was conjectured by Ghorpade and Lachaud in 2000.

Terminology

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 (, m) are given by the so-called Schubert decomposable codewords. We prove the validity of the conjecture for all Schubert varieties Ω(, V m) for all but finitely many values of q.

Sources

Related papers