Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

TIT
2010

favoriteEmaildiscussreport

130views Education» more TIT 2010»

Affine Grassmann codes

12 years 11 months ago

Affine Grassmann codes

Download www.math.iitb.ac.in

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

Real-time Traffic

Affine Grassmann Codes | Education | Large Automorphism Group | Minimum Weight Codewords | TIT 2010 |

claim paper

Related Content

» Decomposable Subspaces Linear Sections of Grassmann Varieties and Higher Weights of Grassm...

» Subclose Families Threshold Graphs and the Weight Hierarchy of Grassmann and Schubert Code...

» Statistical analysis on Stiefel and Grassmann manifolds with applications in computer visi...

» Grassmannian predictive coding for limited feedback multiuser MIMO systems

» Bounds for Codes in Products of Spaces Grassmann and Stiefel Manifolds

» Quantization Bounds on Grassmann Manifolds and Applications to MIMO Communications

» Volume Growth and General Rate Quantization on Grassmann Manifolds

» Unequal dimensional small balls and quantization on Grassmann Manifolds

» Affine Reflection Group Codes

Post Info
More Details (n/a)

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)