paper

Minimum distance of Symplectic Grassmann codes

arXiv:1503.05456 · doi:10.1016/j.laa.2015.09.031

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 and and we determine the minimum distance of the line Symplectic Grassmann codes.

arXiv commentRevised contents and biblography

References in corpus (3)

Cited by in corpus (6)