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

Peter Beelen, Prasant Singh*

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

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 languageEnglish
Article number101843
JournalFinite fields and their applications
Volume73
Number of pages24
ISSN1071-5797
DOIs
Publication statusPublished - Aug 2021

Bibliographical note

Publisher Copyright:
© 2021 Elsevier Inc.

Keywords

  • Grassmann codes
  • Grassmann varieties
  • Majority logic
  • Point-line incidence
  • Schubert varieties

Fingerprint

Dive into the research topics of 'Point-line incidence on Grassmannians and majority logic decoding of Grassmann codes'. Together they form a unique fingerprint.

Cite this