Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability
Information Theory
2018-05-15 v1 math.IT
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.
Cite
@article{arxiv.1805.05270,
title = {Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability},
author = {Alireza Sheikh and Alexandre Graell i Amat and Gianluigi Liva},
journal= {arXiv preprint arXiv:1805.05270},
year = {2018}
}