%0 Journal Article
%T On the minimum stopping sets of product codes
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Hivadi, Morteza
%A Zare Chavoshi, Akbar
%D 2018
%\ 12/01/2018
%V 7
%N 4
%P 1-6
%! On the minimum stopping sets of product codes
%K Stopping set
%K Stopping distance
%K Product code
%R 10.22108/toc.2017.101199.1465
%X 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.
%U https://toc.ui.ac.ir/article_22519_fbd0739ed66110173ab585dee89b4301.pdf