.png){kind=icon}
.png){kind=icon}
Return
Concatenated Codes Based on the Plotkin Construction and Their Soft-Input Decoding
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2022.3158329.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Codes
Maximum likelihood decoding
Concatenated codes
Polar codes
Reliability
Matrix converters
Parity check codes
Channel coding
error correction codes
concatenated codes
Reed-Muller (RM) codes
polar codes
computational complexity
Decoding
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W