Minimum distance of Symplectic Grassmann codes
classification
💻 cs.IT
math.COmath.IT
keywords
codesgrassmannsymplecticdistanceminimumanalogyclassdefined
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.