On parameter optimization of product codes for iterative bounded distance decoding with scaled reliability

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.