Iterative decoding of product codes over binary erasure channel

Abstract

Iterative decoding of product codes over the binary erasure channel is investigated. It is shown that belief propagation decoding combined with cyclic permutations yields near-capacity performance with low complexity for high-code-rate product codes constructed from two cyclic component codes. © 2010 The Institution of Engineering and Technology.