Back to Search
Start Over
Affine Grassmann Codes.
- Source :
- IEEE Transactions on Information Theory; Jul2010, Vol. 56 Issue 7, p3166-3176, 11p
- Publication Year :
- 2010
-
Abstract
- We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum distance of any affine Grassmann code. Moreover, we show that affine Grassmann codes have a large automorphism group and determine the number of minimum weight codewords. [ABSTRACT FROM AUTHOR]
- Subjects :
- LINEAR systems
GRASSMANN manifolds
SET theory
AUTOMORPHISMS
GROUP theory
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 56
- Issue :
- 7
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 51675210
- Full Text :
- https://doi.org/10.1109/TIT.2010.2048470