Affine Grassmann Codes
Information Theory
2010-06-22 v2 Algebraic Geometry
math.IT
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.
Cite
@article{arxiv.0911.1298,
title = {Affine Grassmann Codes},
author = {Peter Beelen and Sudhir R. Ghorpade and Tom Hoeholdt},
journal= {arXiv preprint arXiv:0911.1298},
year = {2010}
}
Comments
Slightly Revised Version; 18 pages