We determine information sets for the generalized Reed–Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also obtain new bases of minimum-weight vectors for the codes of the designs of points and hyperplanes over prime fields.
|Number of pages||16|
|Journal||Finite Fields and Their Applications|
|Publication status||Published - Apr 2006|