Affine Grassmann codes
Publication: Research - peer-review › Journal article – Annual report year: 2010
Standard
Affine Grassmann codes. / Høholdt, Tom; Beelen, Peter; Ghorpade, Sudhir Ramakant.
In: I E E E Transactions on Information Theory, Vol. 56, No. 7, 2010, p. 3166-3176.Publication: Research - peer-review › Journal article – Annual report year: 2010
Harvard
APA
CBE
MLA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Affine Grassmann codes
A1 - Høholdt,Tom
A1 - Beelen,Peter
A1 - Ghorpade,Sudhir Ramakant
AU - Høholdt,Tom
AU - Beelen,Peter
AU - Ghorpade,Sudhir Ramakant
PB - I E E E
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
KW - Grassmann codes
KW - Automorphism group
KW - Number of minimum weight codewords
U2 - 10.1109/TIT.2010.2048470
DO - 10.1109/TIT.2010.2048470
JO - I E E E Transactions on Information Theory
JF - I E E E Transactions on Information Theory
SN - 0018-9448
IS - 7
VL - 56
SP - 3166
EP - 3176
ER -