Affine Subcode Ensemble Decoding of Linear Block Codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910112514310144 |
|---|---|
| author | Mandelbaum, Jonathan Bezner, Paul Jäkel, Holger Brink, Stephan ten Schmalen, Laurent |
| author_facet | Mandelbaum, Jonathan Bezner, Paul Jäkel, Holger Brink, Stephan ten Schmalen, Laurent |
| contents | In the short block length regime, ensemble decoding schemes with their inherently parallel structure can improve error correction performance and reduce latency compared to stand-alone suboptimal decoders such as belief propagation (BP). In this work, we introduce affine subcode ensemble decoding (aSCED), which uses an ensemble of decoders operating on linear block codes and both linear and strictly affine subcodes. This generalizes the recently proposed subcode ensemble decoding (SCED), which is restricted to linear subcodes. We derive BP update rules for affine subcodes and show that aSCED simplifies ensemble design compared to SCED, multiple bases BP, and automorphism ensemble decoding. Monte-Carlo simulations of two low-density parity-check codes and two Bose-Chaudhuri-Hocquenghem (BCH) codes demonstrate improved error correction performance of aSCED over competing existing ensemble schemes. Notably, for one BCH code, when combining ensemble design with algorithms for constructing high-performance parity-check matrices, aSCED achieves near-maximum likelihood performance using only 64 BP decoding paths. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_06889 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Affine Subcode Ensemble Decoding of Linear Block Codes Mandelbaum, Jonathan Bezner, Paul Jäkel, Holger Brink, Stephan ten Schmalen, Laurent Information Theory In the short block length regime, ensemble decoding schemes with their inherently parallel structure can improve error correction performance and reduce latency compared to stand-alone suboptimal decoders such as belief propagation (BP). In this work, we introduce affine subcode ensemble decoding (aSCED), which uses an ensemble of decoders operating on linear block codes and both linear and strictly affine subcodes. This generalizes the recently proposed subcode ensemble decoding (SCED), which is restricted to linear subcodes. We derive BP update rules for affine subcodes and show that aSCED simplifies ensemble design compared to SCED, multiple bases BP, and automorphism ensemble decoding. Monte-Carlo simulations of two low-density parity-check codes and two Bose-Chaudhuri-Hocquenghem (BCH) codes demonstrate improved error correction performance of aSCED over competing existing ensemble schemes. Notably, for one BCH code, when combining ensemble design with algorithms for constructing high-performance parity-check matrices, aSCED achieves near-maximum likelihood performance using only 64 BP decoding paths. |
| title | Affine Subcode Ensemble Decoding of Linear Block Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2604.06889 |