24 research outputs found
Line Polar Grassmann Codes of Orthogonal Type
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\"ucker 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
odd
Codes and caps from orthogonal Grassmannians
In this paper we investigate linear error correcting codes and projective
caps related to the Grassmann embedding of an orthogonal
Grassmannian . In particular, we determine some of the parameters of
the codes arising from the projective system determined by
. We also study special sets of points of
which are met by any line of in at most 2 points and we
show that their image under the Grassmann embedding is a
projective cap.Comment: Keywords: Polar Grassmannian; dual polar space; embedding; error
correcting code; cap; Hadamard matrix; Sylvester construction (this is a
slightly revised version of v2, with updated bibliography
Line polar Grassmann codes of orthogonal type
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\"ucker 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
Some results on caps and codes related to orthogonal Grassmannians — a preview
In this note we offer a short summary of some recent results, to be contained in
a forthcoming paper [4], on projective caps and linear error correcting codes arising from the Grassmann embedding εgr
k of an orthogonal Grassmannian ∆k . More
precisely, we consider the codes arising from the projective system determined by
εgr
k (∆k ) and determine some of their parameters. We also investigate special sets
of points of ∆k which are met by any line of ∆k in at most 2 points proving that
their image under the Grassmann embedding is a projective cap
Minimum distance of Symplectic Grassmann codes
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 and and we determine the minimum
distance of the line Symplectic Grassmann codes.Comment: Revised contents and biblograph
Implementing Line-Hermitian Grassmann codes
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.Comment: 26 page
Minimum distance of Orthogonal Line-Grassmann Codes in even characteristic
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 (doi:10.1016/j.jpaa.2015.10.007 )" 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