Stopping sets of codes from complete bipartite graph

نویسندگان
Maimani, Hamidreza ID 1
Nazari, Mahbubeh ID 2
Tehranian, Abolfazl ID 3

1 Department of Mathematics, Shahid Rajaee Teacher Training University

2 Department of Mathematics, Science and Research Branch, Islamic Azad university, Tehran, Iran.

3 Department of Mathematics, Science and Research Branch, Islamic Azad university, Tehran, Iran.

doi
10.22061/jdma.2025.11781.1115
چکیده

Let C be a code with parity-check matrix H. A stopping set S of size l ≤ n for H is an l-columns submatrix of Hs of H 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 Km,n. These codes are LDPC codes and we obtain the stopping sets for these codes.

کلیدواژه‌ها
Linear code, Stopping set, Complete bipartite graph