ICAR Research Data Repository for Knowledge Management
Affine Grassmann Codes
DSpace at IIT Bombay
View Archive Info| Field | Value | |
| Title |
Affine Grassmann Codes
|
|
| Creator |
BEELEN, P
GHORPADE, SR HOHOLDT, T |
|
| Subject |
reed-muller codes
automorphism group grassmann codes number of minimum weight codewords |
|
| Description |
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.
|
|
| Publisher |
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
|
|
| Date |
2011-07-31T19:23:14Z
2011-12-26T12:53:07Z 2011-12-27T05:40:16Z 2011-07-31T19:23:14Z 2011-12-26T12:53:07Z 2011-12-27T05:40:16Z 2010 |
|
| Type |
Article
|
|
| Identifier |
IEEE TRANSACTIONS ON INFORMATION THEORY, 56(7), 3166-3176
0018-9448 http://dx.doi.org/10.1109/TIT.2010.2048470 http://dspace.library.iitb.ac.in/xmlui/handle/10054/8212 http://hdl.handle.net/10054/8212 |
|
| Language |
en
|
|