Majority Logic Decoding for Certain Schubert Codes Using Lines in Schubert Varieties

Abstract: In this article, we consider Schubert codes, linear codes associated to Schubert varieties, and discuss minimum weight codewords for dual Schubert codes. The notion of lines in Schubert varieties is looked closely at, and it has been proved that the supports of the minimum weight codewords of the dual Schubert codes lie on lines and any three points on a line in Schubert variety correspond to the support of some minimum weight parity check for the Schubert code. We use these lines in Schubert varieties to construct orthogonal parity checks for certain Schubert codes and use them for majority logic decoding. In some special cases, we can correct approximately up to $\lfloor (d-1)/2\rfloor$ many errors where $d$ is the minimum distance of the code.