University of IsfahanTransactions on Combinatorics2251-86577420181201On the minimum stopping sets of product codes162251910.22108/toc.2017.101199.1465ENMortezaHivadiDepartment of mathematics, Institute for Advanced Studies in Basic Science,AkbarZare ChavoshiMalek ashtar university of technologyJournal Article20161221It 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.https://toc.ui.ac.ir/article_22519_fbd0739ed66110173ab585dee89b4301.pdf