Error-and-Erasure Decoding of Product-Like Codes With BCH and SPC Components

We study a class of product-like codes, which is constructed by Bose-Chaudhuri-Hocquenghem (BCH) and single-parity-check (SPC) component codes. We propose a low-complexity error-and-erasure decoding (EaED) algorithm for these codes, where EaED is adopted for both BCH and SPC component codes and thus only ternary messages are exchanged between component decoders. To improve the performance, channel log-likelihood ratios are used to prevent miscorrections, which increases negligible computational complexity and decoder data flow. By properly selecting components, we can construct low-floor BCH-SPC product and staircase codes with a smaller blocklength (or decoding-window size) and a faster speed of convergence compared with the conventional product-like codes with both BCH components. Moreover, the simulation results verified that BCH-SPC product-like codes can outperform the conventional ones in some realistic cases.