Volltext-Downloads (blau) und Frontdoor-Views (grau)

Concatenated Codes Based on the Plotkin Construction and Their Soft-Input Decoding

  • Reed-Muller (RM) codes have recently regained some interest in the context of low latency communications and due to their relation to polar codes. RM codes can be constructed based on the Plotkin construction. In this work, we consider concatenated codes based on the Plotkin construction, where extended Bose-Chaudhuri-Hocquenghem (BCH) codes are used as component codes. This leads to improved code parameters compared to RM codes. Moreover, this construction is more flexible concerning the attainable code rates. Additionally, new soft-input decoding algorithms are proposed that exploit the recursive structure of the concatenation and the cyclic structure of the component codes. First, we consider the decoding of the cyclic component codes and propose a low complexity hybrid ordered statistics decoding algorithm. Next, this algorithm is applied to list decoding of the Plotkin construction. The proposed list decoding approach achieves near-maximum-likelihood performance for codes with medium lengths. The performance is comparable to state-of-the-art decoders, whereas the complexity is reduced.

Export metadata

Additional Services

Share in Twitter Search Google Scholar


Author:Daniel Nicolas BailonORCiD, Martin BossertORCiD, Johann-Philipp ThiersORCiD, Jürgen FreudenbergerORCiDGND
Parent Title (English):IEEE Transactions on Communications
Document Type:Article
Year of Publication:2022
Release Date:2023/01/11
Tag:Channel coding; Error correction codes; Concatenated codes; Reed-Muller (RM) codes; Polar codes; Computational complexity; Decoding
First Page:2939
Last Page:2950
Volltext im Campusnetz der Hochschule Konstanz abrufbar.
Institutes:Institut für Systemdynamik - ISD
Relevance:Peer reviewed Publikation in Master Journal List
Open Access?:Nein
Licence (German):License LogoUrheberrechtlich geschützt