arXiv subjects
Publications and source records attributed to Luca Giuzzi.
In this paper we characterize the non-singular Hermitian variety ${\mathcal H}(6,q^2)$ of $\mathrm{PG}(6, q^2)$, $q\neq2$ among the irreducible hypersurfaces of degree $q+1$ in $\mathrm{PG}(6, q^2)$ not containing solids by the number of its points and the existence of a solid $S$ meeting it in $q^4+q^2+1$ points.
Let $Γ$ be an embeddable non-degenerate polar space of finite rank $n \geq 2$. Assuming that $Γ$ admits the universal embedding (which is true for all embeddable polar spaces except grids of order at least $5$ and certain generalized quadrangles defined over quaternion division rings), let $\varepsilon:Γ\to\mathrm{PG}(V)$ be the universal embedding of $Γ$. Let $\cal S$ be a subspace of $Γ$ and suppose that $\cal S$, regarded as a polar space, has non-degenerate rank at least $2$. We shall prove that $\cal S$ is the $\varepsilon$-preimage of a projective subspace of $\mathrm{PG}(V)$.
In this paper we compute the dimension of the Grassmann embeddings of the polar Grassmannians associated to a possibly degenerate Hermitian, alternating or quadratic form with possibly non-maximal Witt index. Moreover, in the characteristic $2$ case, when the form is quadratic and non-degenerate with bilinearization of minimal Witt index, we define a generalization of the so-called Weyl embedding (see [I. Cardinali and A. Pasini, Grassmann and Weyl embeddings of orthogonal Grassmannians. J. Algebr. Combin. 38 (2013), 863-888]) and prove that the Grassmann embedding is a quotient of this generalized "Weyl-like" embedding. We also estimate the dimension of the latter.
In this paper we compute the generating rank of $k$-polar Grassmannians defined over commutative division rings. Among the new results, we compute the generating rank of $k$-Grassmannians arising from Hermitian forms of Witt index $n$ defined over vector spaces of dimension $N > 2n$. We also study generating sets for the $2$-Grassmannians arising from quadratic forms of Witt index $n$ defined over $V(N,{\mathbb F}_q)$ for $q=4,8,9$ and $2n \leq N \leq 2n+2$. We prove that for $N >6$ they can be generated over the prime subfield, thus determining their generating rank.
For any admissible value of the parameters $n$ and $k$ there exist $[n,k]$-Maximum Rank distance ${\mathbb F}_q$-linear codes. Indeed, it can be shown that if field extensions large enough are considered, almost all rank distance codes are MRD. On the other hand, very few families up to equivalence of such codes are currently known. In the present paper we study some invariants of MRD codes and evaluate their value for the known families, providing a new characterization of generalized twisted Gabidulin codes.
For any admissible value of the parameters there exist Maximum Rank distance (shortly MRD) $\mathbb{F}_{q^n}$-linear codes of $\mathbb{F}_q^{n\times n}$. It has been shown in \cite{H-TNRR} (see also \cite{ByrneRavagnani}) that, if field extensions large enough are considered, then \emph{almost all} (rectangular) rank distance codes are MRD. On the other hand, very few families of $\mathbb{F}_{q^n}$-linear codes are currently known up to equivalence. One of the possible applications of MRD-codes is for McEliece--like public key cryptosystems, as proposed by Gabidulin, Paramonov and Tretjakov in \cite{GPT}. In this framework it is very important to obtain new families of MRD-codes endowed with fast decoding algorithms. Several decoding algorithms exist for Gabidulin codes as shown in \cite{Gabidulin}, see also \cite{Loi06,PWZ,WT}. In this work, we will survey the known families of $\mathbb{F}_{q^n}$-linear MRD-codes, study some invariants of MRD-codes and evaluate their value for the known families, providing a characterization of generalized twisted Gabidulin codes as done in \cite{GiuZ}.
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 $μ$ 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 $μ$ 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.
We introduce the class of transparent embeddings for a point-line geometry $Γ= ({\mathcal P},{\mathcal L})$ as the class of full projective embeddings $\varepsilon$ of $Γ$ such that the preimage of any projective line fully contained in $\varepsilon({\mathcal P})$ is a line of $Γ$. We will then investigate the transparency of Plücker embeddings of projective and polar grassmannians and spin embeddings of half-spin geometries and dual polar spaces of orthogonal type. As an application of our results on transparency, we will derive several Chow-like theorems for polar grassmannians and half-spin geometries.
In this paper we determine the minimum distance of orthogonal line-Grassmann codes for $q$ even. The case $q$ odd was solved in "I. Cardinali, L. Giuzzi, K. Kaipa, A. Pasini, Line Polar Grassmann Codes of Orthogonal Type, J. Pure Applied Algebra." We also show that for $q$ even all minimum weight codewords are equivalent and that symplectic line-Grassmann codes are proper subcodes of codimension $2n$ of the orthogonal ones.
In [I. Cardinali and L. Giuzzi. Line Hermitian Grassmann codes and their parameters. Finite Fields Appl., 51: 407-432, 2018] we introduced line Hermitian Grassmann codes and determined their parameters. The aim of this paper is to present (in the spirit of [I. Cardinali and L. Giuzzi. Enumerative coding for line polar Grassmannians with applications to codes. Finite Fields Appl., 46:107-138, 2017]) an algorithm for the point enumerator of a line Hermitian Grassmannian which can be usefully applied to get efficient encoders, decoders and error correction algorithms for the aforementioned codes.
Let ${\mathcal G}_k(V)$ be the $k$-Grassmannian of a vector space $V$ with $\dim V=n$. Given a hyperplane $H$ of ${\mathcal G}_k(V)$, we define in [I. Cardinali, L. Giuzzi, A. Pasini, A geometric approach to alternating $k$-linear forms, J. Algebraic Combin. doi:10.1007/s10801-016-0730-6] a point-line subgeometry of ${\mathrm{PG}}(V)$ called the {\it geometry of poles of $H$}. In the present paper, exploiting the classification of alternating trilinear forms in low dimension, we characterize the possible geometries of poles arising for $k=3$ and $n\leq 7$ and propose some new constructions. We also extend a result of [J.Draisma, R. Shaw, Singular lines of trilinear forms, Linear Algebra Appl. doi:10.1016/j.laa.2010.03.040] regarding the existence of line spreads of ${\mathrm{PG}}(5,{\mathbb K})$ arising from hyperplanes of ${\mathcal G}_3(V).$
In this article we construct new minimal intersection sets in ${\mathrm{AG}}(r,q^2)$ sporting three intersection numbers with hyperplanes; we then use these sets to obtain linear error correcting codes with few weights, whose weight enumerator we also determine. Furthermore, we provide a new family of three-character multisets in ${\mathrm{PG}}(r,q^2)$ with $r$ even and we also compute their weight distribution.
We determine the possible intersection sizes of a Hermitian surface $\mathcal H$ with an irreducible quadric of ${\mathrm PG}(3,q^2)$ sharing at least a tangent plane at a common non-singular point when $q$ is even.
Given an $n$-dimensional vector space $V$ over a field $\mathbb K$, let $2\leq k < n$. There is a natural correspondence between the alternating $k$-linear forms $φ$ of $V$ and the linear functionals $f$ of $\bigwedge^kV$. Let $\varepsilon_k:{\mathcal G}_k(V)\rightarrow {\mathrm{PG}}(\bigwedge^kV)$ be the Plucker embedding of the $k$-Grassmannian ${\mathcal G}_k(V)$ of $V$. Then $\varepsilon_k^{-1}(\ker(f)\cap\varepsilon_k(\mathcal{G}_k(V)))$ is a hyperplane of the point-line geometry ${\mathcal G}_k(V)$. All hyperplanes of ${\mathcal G}_k(V)$ can be obtained in this way. For a hyperplane $H$ of ${\mathcal G}_k(V)$, let $R^\uparrow(H)$ be the subspace of ${\mathcal G}_{k-1}(V)$ formed by the $(k-1)$-subspaces $A\subset V$ such that $H$ contains all $k$-subspaces that contain $A$. In other words, if $φ$ is the (unique modulo a scalar) alternating $k$-linear form defining $H$, then the elements of $R^\uparrow(H)$ are the $(k-1)$-subspaces $A = \langle a_1,\ldots, a_{k-1}\rangle$ of $V$ such that $φ(a_1,\ldots, a_{k-1},x) = 0$ for all $x\in V$. When $n-k$ is even it might be that $R^\uparrow(H) = \emptyset$. When $n-k$ is odd, then $R^\uparrow(H) \neq \emptyset$, since every $(k-2)$-subspace of $V$ is contained in at least one member of $R^\uparrow(H)$. If every $(k-2)$-subspace of $V$ is contained in precisely one member of $R^\uparrow(H)$ we say that $R^\uparrow(H)$ is spread-like. In this paper we obtain some results on $R^\uparrow(H)$ which answer some open questions from the literature and suggest the conjecture that, if $n-k$ is even and at least $4$, then $R^\uparrow(H) \neq \emptyset$ but for one exception with ${\mathbb K}\leq{\mathbb R}$ and $(n,k) = (7,3)$, while if $n-k$ is odd and at least $5$ then $R^\uparrow(H)$ is never spread-like.
We present a concise description of Orthogonal Polar Grassmann Codes and motivate their relevance. We also describe efficient encoding and decoding algorithms for the case of Line Grassmannians and introduce some open problems.
We introduce the Symplectic Grassmann codes as projective codes defined by symplectic Grassmannians, in analogy with the orthogonal Grassmann codes introduced in [4]. Note that the Lagrangian-Grassmannian codes are a special class of Symplectic Grassmann codes. We describe the weight enumerator of the Lagrangian--Grassmannian codes of rank $2$ and $3$ and we determine the minimum distance of the line Symplectic Grassmann codes.
Polar Grassmann codes of orthogonal type have been introduced in I. Cardinali and L. Giuzzi, \emph{Codes and caps from orthogonal Grassmannians}, {Finite Fields Appl.} {\bf 24} (2013), 148-169. They are subcodes of the Grassmann code arising from the projective system defined by the Plücker embedding of a polar Grassmannian of orthogonal type. In the present paper we fully determine the minimum distance of line polar Grassmann Codes of orthogonal type for $q$ odd.
In $PG(3,q^2)$, with $q$ odd, we determine the possible intersection sizes of a Hermitian surface $\mathcal{H}$ and an irreducible quadric $\mathcal{Q}$ having the same tangent plane $π$ at a common point $P\in{\mathcal Q}\cap{\mathcal H}$.