On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability

08/26/2019
by   Alireza Sheikh, et al.
0

We use density evolution to optimize the parameters of binary product codes (PCs) decoded based on the recently introduced iterative bounded distance decoding with scaled reliability. We show that binary PCs with component codes of 3-bit error correcting capability provide the best performance-complexity trade-off.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/14/2018

Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability

We propose a modified iterative bounded distance decoding of product cod...
research
12/20/2021

A Novel Iterative Soft-Decision Decoding Algorithm for RS-SPC Product Codes

This paper presents a generalized construction of RS-SPC product codes. ...
research
12/29/2018

The Crossover-Distance for ISI-Correcting Decoding of Convolutional Codes in Diffusion-Based Molecular Communications

In diffusion based molecular communication, the intersymbol interference...
research
02/10/2019

Binary Message Passing Decoding of Product-like Codes

We propose a novel binary message passing decoding algorithm for product...
research
06/28/2018

On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems

We study low-complexity iterative decoding algorithms for product codes....
research
05/29/2020

Refined Reliability Combining for Binary Message Passing Decoding of Product Codes

We propose a novel soft-aided iterative decoding algorithm for product c...
research
11/22/2021

Algorithmizing the Multiplicity Schwartz-Zippel Lemma

The multiplicity Schwartz-Zippel lemma asserts that over a field, a low-...

Please sign up or login with your details

Forgot password? Click here to reset