Abstract
In this article, we consider the decoding problem of Grassmann codes using majority logic. We show that for two points of the Grassmannian, there exists a canonical geodesic between these points once a complete flag is fixed. These geodesics are used to construct a large set of parity checks orthogonal on a coordinate of the code, resulting in a majority decoding algorithm.
Original language | English |
---|---|
Article number | 101843 |
Journal | Finite Fields and Their Applications |
Volume | 73 |
Number of pages | 24 |
ISSN | 1071-5797 |
DOIs | |
Publication status | Published - Aug 2021 |
Bibliographical note
Publisher Copyright:© 2021 Elsevier Inc.
Keywords
- Grassmann codes
- Grassmann varieties
- Majority logic
- Point-line incidence
- Schubert varieties