On Constructions of Reed-Muller Subcodes

Johannes Van Wonterghem, Joseph Boutros, Marc Moeneclaey

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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
Volume22
Issue number2
DOIs
Publication statusPublished - 1 Feb 2018

Fingerprint

Greedy Algorithm
Generator
Reed-Muller Codes
Overlap
Computer Simulation
Computer simulation

Keywords

  • Reed-Muller codes
  • subcodes

ASJC Scopus subject areas

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

Cite this

On Constructions of Reed-Muller Subcodes. / Van Wonterghem, Johannes; Boutros, Joseph; Moeneclaey, Marc.

In: IEEE Communications Letters, Vol. 22, No. 2, 8103757, 01.02.2018, p. 220-223.

Research output: Contribution to journalArticle

Van Wonterghem, J, Boutros, J & Moeneclaey, M 2018, 'On Constructions of Reed-Muller Subcodes', IEEE Communications Letters, vol. 22, no. 2, 8103757, pp. 220-223. https://doi.org/10.1109/LCOMM.2017.2772247
Van Wonterghem, Johannes ; Boutros, Joseph ; Moeneclaey, Marc. / On Constructions of Reed-Muller Subcodes. In: IEEE Communications Letters. 2018 ; Vol. 22, No. 2. pp. 220-223.
@article{be5a6b56ff0e48ad87066821fd228bba,
title = "On Constructions of Reed-Muller Subcodes",
abstract = "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.",
keywords = "Reed-Muller codes, subcodes",
author = "{Van Wonterghem}, Johannes and Joseph Boutros and Marc Moeneclaey",
year = "2018",
month = "2",
day = "1",
doi = "10.1109/LCOMM.2017.2772247",
language = "English",
volume = "22",
pages = "220--223",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - On Constructions of Reed-Muller Subcodes

AU - Van Wonterghem, Johannes

AU - Boutros, Joseph

AU - Moeneclaey, Marc

PY - 2018/2/1

Y1 - 2018/2/1

N2 - 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.

AB - 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.

KW - Reed-Muller codes

KW - subcodes

UR - http://www.scopus.com/inward/record.url?scp=85034240870&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034240870&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2017.2772247

DO - 10.1109/LCOMM.2017.2772247

M3 - Article

VL - 22

SP - 220

EP - 223

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 2

M1 - 8103757

ER -