Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability
Abstract
We propose a modified iterative bounded distance decoding of product codes. The proposed algorithm is based on exchanging hard messages iteratively and exploiting channel reliabilities to make hard decisions at each iteration. Performance improvements up to 0.26 dB are achieved.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2018
- DOI:
- 10.48550/arXiv.1805.05270
- arXiv:
- arXiv:1805.05270
- Bibcode:
- 2018arXiv180505270S
- Keywords:
-
- Computer Science - Information Theory