Point-line incidence on Grassmannians and majority logic decoding of Grassmann codes
Information Theory
2020-01-20 v1 Algebraic Geometry
math.IT
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 path between these points once a complete flag is fixed. These paths are used to construct a large set of parity checks orthogonal on a coordinate of the code, resulting in a majority decoding algorithm.
Keywords
Cite
@article{arxiv.2001.06278,
title = {Point-line incidence on Grassmannians and majority logic decoding of Grassmann codes},
author = {Peter Beelen and Prasant Singh},
journal= {arXiv preprint arXiv:2001.06278},
year = {2020}
}