首页|Stopping sets of codes from complete graph

Stopping sets of codes from complete 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 H-s of H which dose not contain a row with weight one. In this paper we consider the code which parity-check matrix is incidence matrix of complete graph K-m. These codes are LDPC codes and we obtain the stopping sets for these codes.

Linear codeStopping setComplete graph

Nazari, M.、Maimani, H. R.

展开 >

Islamic Azad Univ

Shahid Rajaee Teacher Training Univ

2022

Journal of Discrete Mathematical Sciences and Cryptography

Journal of Discrete Mathematical Sciences and Cryptography

ISSN:0972-0529
年,卷(期):2022.25(2)
  • 6