论文标题
格拉斯曼人的点线发病率和大多数逻辑解码
Point-line incidence on Grassmannians and majority logic decoding of Grassmann codes
论文作者
论文摘要
在本文中，我们考虑了使用多数逻辑的Grassmann代码的解码问题。我们表明，在固定一个完整的旗帜后，在司法的两个点上，在这些点之间存在一条规范的路径。这些路径用于在代码的坐标上构造一组奇偶校验检查正交，从而导致大多数解码算法。
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.
