Information set and iterative encoding for Affine Grassmann codes
Sudhir R. Ghorpade, Fernando Piñero · 2015
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.