Reed-Muller codes and permutation decoding

Research output: Contribution to journalArticlepeer-review

11 Citations (SciVal)


We show that the first- and second-order Reed–Muller codes, and , can be used for permutation decoding by finding, within the translation group, (m−1)- and (m+1)-PD-sets for for m≥5,6, respectively, and (m−3)-PD-sets for for m≥8. We extend the results of Seneviratne [P. Seneviratne, Partial permutation decoding for the first-order Reed-Muller codes, Discrete Math., 309 (2009), 1967–1970].
Original languageEnglish
Pages (from-to)3114-3119
Number of pages6
JournalDiscrete Mathematics
Publication statusPublished - 28 Nov 2010


Dive into the research topics of 'Reed-Muller codes and permutation decoding'. Together they form a unique fingerprint.

Cite this