2000 character limit reached
Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability (1805.05270v1)
Published 14 May 2018 in cs.IT and 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.