Publication: Research - peer-review › Journal article – Annual report year: 2012
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.
|Citations||Web of Science® Times Cited: No match on DOI|
- Linear codes, Reed-Muller codes, Electronic mail , Frequency modulation, Linear code , Parity check codes, Polynomials, Sparse matrices
No data available