Codes on linear sections of the Grassmannian (Q2048389): Difference between revisions

Let \(\mathbb{F}_q\) denote a finite field having \(q\) elements, where \(q\) is a prime power. For a vector space \(E\) of finite dimension \(m\) over \(\mathbb{F}_q\) and \(\ell\le m\), let \(G(\ell, m)\) denote the Grassmannian variety of vector subspaces of dimension \(\ell\) of \(E\). A projective variety \(X\) is called a linear section of the of the Grassmannian \(G(\ell,m)\) if \(X=G(\ell, m)\cap Z(g_1,\ldots, g_N)\), where \(g_1, g_2, \ldots, g_N\) are linearly independent functionals in the ideal that they generate and \(X(\mathbb{F}_q)=\{P_1, \ldots, P_M\}\) is a non-empty set of \(\mathbb{F}_q\)-rational points of \(X\). In this paper, authors study parity-check codes by showing that for every linear section of a Grassmannian, there exists a parity check code with good properties depending on the linear sections. For the Lagrangian-Grassmannian variety, they reveal that these parity-check codes are the low density parity check (LDPC) codes. They also obtained some properties of parity check codes associated to linear sections of Grassmannians.