Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 232-247 |
Number of pages | 16 |
Journal | Finite Fields and Their Applications |
Volume | 12 |
Issue number | 2 |
DOIs | |
Publication status | Published - Apr 2006 |