Affine Grassmann codes

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

View graph of relations

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.
Original languageEnglish
JournalI E E E Transactions on Information Theory
Publication date2010
Volume56
Journal number7
Pages3166-3176
ISSN0018-9448
DOIs
StatePublished
CitationsWeb of Science® Times Cited: 3

Keywords

  • Grassmann codes, Automorphism group, Number of minimum weight codewords
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

ID: 4985229