University of Isfahan Transactions on Combinatorics 2251-8657 7 4 2018 12 01 On the minimum stopping sets of product codes 1 6 22519 10.22108/toc.2017.101199.1465 EN Morteza Hivadi Department of mathematics, Institute for Advanced Studies in Basic Science, Akbar Zare Chavoshi Malek ashtar university of technology Journal Article 2016 12 21 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. Stopping set Stopping distance Product code https://toc.ui.ac.ir/article_22519_fbd0739ed66110173ab585dee89b4301.pdf