Sciweavers

TIT
2010

Affine Grassmann codes

13 years 6 months ago
Affine Grassmann codes
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.
Peter Beelen, Sudhir R. Ghorpade, Tom Høhol
Added 22 May 2011
Updated 22 May 2011
Type Journal
Year 2010
Where TIT
Authors Peter Beelen, Sudhir R. Ghorpade, Tom Høholdt
Comments (0)