Point-line incidence on Grassmannians and majority logic decoding of Grassmann codes

In this article, we consider the decoding problem of Grassmann codes using majority logic. We show that for two points Grassmannian, there exists a canonical geodesic between these once complete flag is fixed. These geodesics are used to construct large set parity checks orthogonal on coordinate code, resulting in algorithm.