Name
Abstract | ||
|---|---|---|
Affine Grassmann codes are a variant of generalized Reed–Muller codes and are closely related to Grassmann codes. These codes were introduced in a recent work by Beelen Here, we consider, more generally, affine Grassmann codes of a given level. We explicitly determine the dual of an affine Grassmann code of any level and compute its minimum distance. Further, we ameliorate the results by Beelen concerning the automorphism group of affine Grassmann codes. Finally, we prove that affine Grassmann codes and their duals have the property that they are linear codes generated by their minimum-weight codewords. This provides a clean analogue of a corresponding result for generalized Reed–Muller codes. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TIT.2012.2187171 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
frequency modulation,dual code,information theory,reed muller codes,sparse matrices,reed muller code,polynomials,linear code | Journal | 58 |
Issue | ISSN | Citations |
6 | IEEE Transactions on Information Theory, Vol. 58, No. 6 (2012),
pp. 3843-3855 | 8 |
PageRank | References | Authors |
0.88 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Beelen | 1 | 116 | 15.95 |
| Sudhir R. Ghorpade | 2 | 80 | 12.16 |
| Tom Høholdt | 3 | 186 | 28.53 |