Volltext-Downloads (blau) und Frontdoor-Views (grau)
The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 6 of 103
Back to Result List

List decoding for concatenated codes based on the Plotkin construction with BCH component codes

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

Export metadata

Additional Services

Search Google Scholar

Statistics

frontdoor_oas
Metadaten
Author:Daniel Nicolas BailonORCiD, Jürgen FreudenbergerORCiDGND
DOI:https://doi.org/10.1109/ISTC49272.2021.9594194
ISBN:978-1-6654-0943-8
ISBN:978-1-6654-0944-5
Parent Title (English):11th International Symposium on Topics in Coding (ISTC), 30. August - 3. September 2021, Montreal, QC, Canada, virtual
Publisher:IEEE
Document Type:Conference Proceeding
Language:English
Year of Publication:2021
Release Date:2022/01/11
Page Number:5
Note:
Volltext im Campusnetz der Hochschule Konstanz abrufbar.
Institutes:Institut für Systemdynamik - ISD
Relevance:Keine peer reviewed Publikation (Wissenschaftlicher Artikel und Aufsatz, Proceeding, Artikel in Tagungsband)
Open Access?:Nein
Licence (German):License LogoUrheberrechtlich geschützt