A simple iterative soft decoding algorithm for Reed-Solomon product codes

We propose a novel iterative decoding algorithm based on partial combination of the parity check matrix for iterative soft decoding of Reed-Solomon product codes. It uses only the simple syndrome equations whose solutions are confined to parts of the columns of the parity check matrix. Compared to other algorithms, the proposed algorithm has lower complexity while offering better performance, which is demonstrated by simulations.