Enumerative coding for line polar Grassmannians with applications to codes (Q2363322): Difference between revisions

For a vector space \(E\) of finite dimension \(n\) over a field \(K\) and any integer \(1\leq k<n\), let \(G_{n,k}\) denote the Grassmannian of vector subspaces of dimension \(k\) of \(E\). By the Plücker embedding \(G_{n,k}\) is a closed subvariety of the projective space \({\mathbb P}(\textstyle\bigwedge^kE)\) associated to the \(k\)-th exterior power of \(E\). Assuming that the ground field \(K={\mathbb F}_q\) is finite and that the vector space \(E\) has a non-degenerate symmetric or alternating form, the article focuses on the subvarieties of the Grassmannian \(G_{n,k}\) of totally isotropic subspaces, where their dimension \(k\) has to satisfy the obvious condition in the symplectic case. The main result of the paper is an efficient algorithm that enumerates the points in these orthogonal or symplectic Grassmannians when \(k=2\). As an application the authors describe an implementation of the corresponding orthogonal or symplectic Grassmannian linear code determined by the \({\mathbb F}_q\)-rational points of these subvarieties. The implementation includes the encoding and decoding algorithms, with whole details for the orthogonal Grassmannian, remarking that the symplectic case is totally analogous.