Shahid Rajaee Teacher Training University Journal of Discrete Mathematics and Its Applications 2981-0809 11 2 2026 06 01 Stopping sets of codes from complete bipartite graph 87 97 12564 10.22061/jdma.2025.11781.1115 EN Hamidreza Maimani Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Iran Mahbubeh Nazari Department of Mathematics, Science and Research Branch, Islamic Azad university, Tehran, Iran. Abolfazl Tehranian Department of Mathematics, Science and Research Branch, Islamic Azad university, Tehran, Iran. Journal Article 2025 02 23 Let <em>C</em> be a code with parity-check matrix <em>H</em>. A stopping set <em>S</em> of size <em>l</em> ≤ <em>n</em> for <em>H</em> is an <em>l</em>-columns submatrix of <em>H<sub>s</sub></em> of <em>H</em> which does not contain a row with weight one. In this paper we consider the code which parity-check is incidence matrix of complete bipartite graph <em>K<sub>m,n</sub></em>. These codes are LDPC codes and we obtain the stopping sets for these codes. Linear code Stopping set Complete bipartite graph https://jdma.sru.ac.ir/article_12564_f6ca2b6c40393449f82c5e4fec61bdfb.pdf