On Constructions of Reed-Muller Subcodes

On Constructions of Reed-Muller Subcodes

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters 2018-02, Vol.22 (2), p.220-223
Hauptverfasser: Van Wonterghem, Johannes, Boutros, Joseph J., Moeneclaey, Marc
Format: Artikel
Sprache:eng
Schlagworte:
Computer simulation
Error probability
Generators
Greedy algorithms
Maximum likelihood decoding
Reed–Muller codes
Signal to noise ratio
subcodes
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2017.2772247