Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability
classification
💻 cs.IT
math.IT
keywords
boundedcodesdecodingdistanceharditerativeproductachieved
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.