LDPC codes from cubic semisymmetric graphs
Abstract
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.
Keywords
LDPC code, cubic graph, semisymmetric graph
DOI: https://doi.org/10.26493/1855-3974.2501.4c4
ISSN: 1855-3974
Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications