Information sets and partial permutation decoding for codes from finite geometries

Research output: Contribution to journalArticlepeer-review

32 Citations (SciVal)

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 languageEnglish
Pages (from-to)232-247
Number of pages16
JournalFinite Fields and Their Applications
Volume12
Issue number2
DOIs
Publication statusPublished - Apr 2006

Fingerprint

Dive into the research topics of 'Information sets and partial permutation decoding for codes from finite geometries'. Together they form a unique fingerprint.

Cite this