On Constructions of Reed-Muller Subcodes

Johannes Van Wonterghem, Joseph Boutros, Marc Moeneclaey

Research output: Contribution to journalArticle

2 Citations (Scopus)


In this letter, subcodes constructed from Reed-Muller codes by removal of generator matrix rows are considered. A new greedy algorithm based on the overlap of generator matrix rows is developed. To select the best subcode generated by the greedy algorithm, the number of minimum weight code words is determined. Computer simulations confirm that the greedy algorithm outperforms the three other construction methods, generating the best codes among all presented subcodes.

Original languageEnglish
Article number8103757
Pages (from-to)220-223
Number of pages4
JournalIEEE Communications Letters
Issue number2
Publication statusPublished - 1 Feb 2018



  • Reed-Muller codes
  • subcodes

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this