Stopping sets of codes from complete bipartite graph

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