Back to Search
Start Over
Affine Symplectic Grassmann codes
- Publication Year :
- 2022
-
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.<br />Comment: arXiv admin note: substantial text overlap with arXiv:2110.08964
- Subjects :
- Computer Science - Information Theory
94B05, 94B27, 14M15, 14G50
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2206.01872
- Document Type :
- Working Paper