Duals of Affine Grassmann Codes and Their Relatives

Publication: Research - peer-reviewJournal article – Annual report year: 2012

Documents

DOI

View graph of relations

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.
Original languageEnglish
JournalI E E E Transactions on Information Theory
Publication date2012
Volume58
Issue6
Pages3843-3855
ISSN0018-9448
DOIs
StatePublished
CitationsWeb of Science® Times Cited: 2

Keywords

  • Linear codes, Reed-Muller codes, Electronic mail , Frequency modulation, Linear code , Parity check codes, Polynomials, Sparse matrices
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 9739446