Minimum distance of Symplectic Grassmann codes
Information Theory
2015-10-05 v3 Combinatorics
math.IT
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.
Cite
@article{arxiv.1503.05456,
title = {Minimum distance of Symplectic Grassmann codes},
author = {Ilaria Cardinali and Luca Giuzzi},
journal= {arXiv preprint arXiv:1503.05456},
year = {2015}
}
Comments
Revised contents and biblography