Name
Abstract | ||
|---|---|---|
We explicitly determine an information set for the affine Grassmann codes of an arbitrary level and then use it to describe a systematic encoder for these codes. In the case of affine Grassmann codes of full level, we use our explicit information set together with some known results concerning duals of affine Grassmann codes to describe an iterative encoding algorithm and also show that permutation decoding is possible up to a reasonable bound. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/IWSDA.2015.7458398 | 2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) |
Keywords | Field | DocType |
Grassmannian,linear code,information set,rook arrangements,systematic encoder,iterative encoding,Tanner code,permutation decoding | Affine transformation,Discrete mathematics,Algebra,Dual polyhedron,Linear code,Grassmannian,Encoder,Information set,Permutation decoding,Mathematics,Encoding (memory) | Conference |
ISSN | Citations | PageRank |
2150-3680 | 0 | 0.34 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sudhir R. Ghorpade | 1 | 80 | 12.16 |
| Fernando L. Piñero | 2 | 0 | 0.34 |