On the minimum distances of Schubert codes
Hao Chen · IEEE Transactions on Information Theory · 2000
Ghorpade and Lachaud (1998) introduced Schubert codes as codes corresponding to the protective system (Tsfasman and Vladut 1991) defined by Schubert subvarieties of Grassmann varieties Gr(l,m). They gave an upper bound for the minimum distances of these codes in Ghorpade and Lachaud and conjectured their true minimum distances. In this note we prove the conjecture in the case of l=2.