Enumerative coding for line polar Grassmannians with applications to codes

Applications to coding theory and cryptography of arithmetic geometry (14G50) Grassmannians, Schubert varieties, flag manifolds (14M15) Linear codes (general theory) (94B05)

Abstract: A

k

-polar Grassmannian is the geometry having as pointset the set of all

k

-dimensional subspaces of a vector space

V

which are totally isotropic for a given non-degenerate bilinear form

m u

defined on

V .

Hence it can be regarded as a subgeometry of the ordinary

k

-Grassmannian. In this paper we deal with orthogonal line Grassmannians and with symplectic line Grassmannians, i.e. we assume

k = 2

and

m u

a non-degenerate symmetric or alternating form. We will provide a method to efficiently enumerate the pointsets of both orthogonal and symplectic line Grassmannians. This has several nice applications; among them, we shall discuss an efficient encoding/decoding/error correction strategy for line polar Grassmann codes of both types.

Review text

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.

Recommendations

Cites work

Cited in

(11)

This page was built for publication: Enumerative coding for line polar Grassmannians with applications to codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363322)