On the minimum stopping sets of product codes

Abstract

It is shown that the certain combinatorial structures called stopping sets have the important role in analysis of iterative decoding. In this paper, the number of minimum stopping sets of a product code is determined by the number of the minimum stopping sets of the corresponding component codes. As an example, the number of minimum stopping sets of the r-dimensional SPC product code is computed.

Keywords

• stopping set
• stopping distance
• product code