In this paper we investigate linear error correcting codes and projective caps related to the Grassmann embedding $\varepsilon_k^{gr}$ of an orthogonal Grassmannian $\Delta_k$. In particular, we determine some of the parameters of the codes arising from the projective system determined by $\varepsilon_k^{gr}(\Delta_k)$. We also study special sets of points of $\Delta_k$ which are met by any line of $\Delta_k$ in at most $2$ points and we show that their image under the Grassmann embedding $\varepsilon_k^{gr}$ is a projective cap
In this paper we determine the minimum distance of orthogonal line-Grassmann codes for q even. The c...
The linear code $\C_{s,t}(n,q)$ of $s$-spaces and $t$-spaces in a projective space $\PG(n,q)$, $q=p^...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
In this paper we investigate linear error correcting codes and projective caps related to the Gras...
In this note we offer a short summary of some recent results, to be contained in a forthcoming pap...
Polar Grassmann codes of orthogonal type have been introduced in I. Cardinali and L. Giuzzi, \emph{C...
Polar Grassmann codes of orthogonal type have been introduced in I. Cardinali and L. Giuzzi, \emph{C...
A k-polar Grassmannian is a geometry having as pointset the set of all k-dimensional subspaces of a ...
We consider the question of determining the maximum number of points on sections of Grassmannians ov...
In this paper we introduce and study line Hermitian Grassmann codes as those subcodes of the Grassma...
AbstractWe consider the question of determining the maximum number of points on sections of Grassman...
Projective space of order $n$ over a finite field $GF(q)$, denoted by $\mathcal{P}_{q}(n),$ is a set...
AbstractWe find PD-sets for some binary Grassmann codes, that is, for the projective Reed–Muller cod...
In this paper we introduce symplectic Grassmann codes, in analogy to ordinary Grassmann codes and or...
We use a theorem of Chow (1949) on line-preserving bijections of Grassmannians to determine the auto...
In this paper we determine the minimum distance of orthogonal line-Grassmann codes for q even. The c...
The linear code $\C_{s,t}(n,q)$ of $s$-spaces and $t$-spaces in a projective space $\PG(n,q)$, $q=p^...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
In this paper we investigate linear error correcting codes and projective caps related to the Gras...
In this note we offer a short summary of some recent results, to be contained in a forthcoming pap...
Polar Grassmann codes of orthogonal type have been introduced in I. Cardinali and L. Giuzzi, \emph{C...
Polar Grassmann codes of orthogonal type have been introduced in I. Cardinali and L. Giuzzi, \emph{C...
A k-polar Grassmannian is a geometry having as pointset the set of all k-dimensional subspaces of a ...
We consider the question of determining the maximum number of points on sections of Grassmannians ov...
In this paper we introduce and study line Hermitian Grassmann codes as those subcodes of the Grassma...
AbstractWe consider the question of determining the maximum number of points on sections of Grassman...
Projective space of order $n$ over a finite field $GF(q)$, denoted by $\mathcal{P}_{q}(n),$ is a set...
AbstractWe find PD-sets for some binary Grassmann codes, that is, for the projective Reed–Muller cod...
In this paper we introduce symplectic Grassmann codes, in analogy to ordinary Grassmann codes and or...
We use a theorem of Chow (1949) on line-preserving bijections of Grassmannians to determine the auto...
In this paper we determine the minimum distance of orthogonal line-Grassmann codes for q even. The c...
The linear code $\C_{s,t}(n,q)$ of $s$-spaces and $t$-spaces in a projective space $\PG(n,q)$, $q=p^...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...