Implementing line-Hermitian Grassmann codes (Q2273836): Difference between revisions

For a finite field of the form \({\mathbb F}_{q^2}\), with \(q\) a prime power, in which case \({\mathbb F}_{q^2}\) has the involution given by \(\sigma(a)=a^q\), and an \({\mathbb F}_{q^2}\)-vector space \(V\) of finite dimension \(m\) with the nondegenerate \(\sigma\)-sesquilinear hermitian form induced by the involution of the base field, in [Finite Fields Appl. 51, 407--432 (2018; Zbl 1393.14046)] the authors considered the corresponding line Hermitian Grassmann varieties \(H_{m,2}\) and the associated linear codes and obtained explicit formulas for the word length, dimension and minimum distance of these codes. Following previous work of the authors, for the orthogonal and symplectic line Grassmann codes [Finite Fields Appl. 46, 107--138 (2017; Zbl 1375.14164)] in the paper under review the authors obtain a counting algorithm for the \({\mathbb F}_{q^2}\)-rational points of the Hermitian variety \(H_{m,2}\), with a prescribed prefix, and prove that the complexity of this algorithm is \(O(m^2)\). Their second result gives an algorithm for the point enumerator of line Hermitian Grassmannians whose computational complexity is \(O(q^4m^3)\).