On the minimum stopping sets of product codes

Document Type: Research Paper

Authors

1 Department of mathematics, Institute for Advanced Studies in Basic Science,

2 Malek ashtar university of technology

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

Main Subjects