TY  - CHAP
U1  - Konferenzveröffentlichung
A1  - Bailon, Daniel Nicolas
A1  - Freudenberger, Jürgen
T1  - List decoding for concatenated codes based on the Plotkin construction with BCH component codes
T2  - 11th International Symposium on Topics in Coding (ISTC), 30. August - 3. September 2021, Montreal, QC, Canada, virtual
N2  - Reed-Muller codes are a popular code family based on the Plotkin construction. Recently, these codes have regained some interest due to their close relation to polar codes and their low-complexity decoding. We consider a similar code family, i.e., the Plotkin concatenation with binary BCH component codes. This construction is more flexible regarding the attainable code parameters. In this work, we consider a list-based decoding algorithm for the Plotkin concatenation with BCH component codes. The proposed list decoding leads to a significant coding gain with only a small increase in computational complexity. Simulation results demonstrate that the Plotkin concatenation with the proposed decoding achieves near maximum likelihood decoding performance. This coding scheme can outperform polar codes for moderate code lengths.
Y1  - 2021
SN  - 978-1-6654-0943-8
SB  - 978-1-6654-0943-8
SN  - 978-1-6654-0944-5
SB  - 978-1-6654-0944-5
U6  - https://doi.org/10.1109/ISTC49272.2021.9594194
DO  - https://doi.org/10.1109/ISTC49272.2021.9594194
N1  - Volltext im Campusnetz der Hochschule Konstanz abrufbar.
SP  - 5
S1  - 5
PB  - IEEE
ER  -