Affine Symplectic Grassmann codes
Information Theory
2022-06-14 v3 math.IT
Abstract
In this manuscript, we introduce a new class of linear codes, called affine symplectic Grassmann codes, and determine their parameters, automorphism group, minimum distance codewords, dual code and other key features. These linear codes are defined from an affine part of a polar symplectic Grassmannian. They combine polar symplectic Grassmann codes and affine Grassmann codes.
Cite
@article{arxiv.2206.01872,
title = {Affine Symplectic Grassmann codes},
author = {Fernando Piñero González and Doel Rivera Laboy},
journal= {arXiv preprint arXiv:2206.01872},
year = {2022}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2110.08964