LDPC codes from cubic semisymmetric graphs

Dean Crnković; Sanja Rukavina; Marina Šimac

doi:10.26493/1855-3974.2501.4c4

Authors

Dean Crnković University of Rijeka, Croatia https://orcid.org/0000-0002-3299-7859
Sanja Rukavina University of Rijeka, Croatia https://orcid.org/0000-0003-3365-7925
Marina Šimac University of Rijeka, Croatia https://orcid.org/0000-0001-9291-3365

DOI:

https://doi.org/10.26493/1855-3974.2501.4c4

Keywords:

LDPC code, cubic graph, semisymmetric graph

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.

LDPC codes from cubic semisymmetric graphs

Authors

DOI:

Keywords:

Abstract

Downloads

Published

Issue

Section

License

Developed By

Information