On the iterative decoding of binary product codes over the binary erasure channel
P. R. de Freitas, Valdemar C. da Rocha, J. S. Lemos-Neto · 2011
Iterative decoding in two dimensions over the binary erasure channel is investigated when identical linear binary cyclic codes are employed in each dimension. Decoding of the overall code is simplified by employing iterative decoding with cyclic permutations for the component code in each dimension. Decoding complexity versus performance can be traded as a function mainly of the number of minimum weight codewords selected from the dual of each component code. Using results from computer simulations, a comparative analysis is presented of various iterative decoding algorithms in two dimensions applied to simple codes, specifically the product codes (961,676,9), (225,49,25) and (961,256,49).