LDPC codes from cubic semisymmetric graphs
Dean Crnković, Sanja Rukavina, Marina Šimac · Ars Mathematica Contemporanea · 2021
In this paper we study LDPC codes having cubic semisymmetric graphs as their Tanner graphs. We discuss the structure of the smallest absorbing sets of these LDPC codes. Further, we give an expression for the variance of the syndrome weight of the constructed codes, and present computational and simulation results.