Name
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.ffa.2021.101843 | Finite Fields and Their Applications |
Keywords | DocType | Volume |
94B27,14G50 | Journal | 73 |
ISSN | Citations | PageRank |
1071-5797 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Beelen Peter | 1 | 0 | 0.34 |
| Prasant Singh | 2 | 2 | 1.80 |