Paper detail

LDPC codes constructed from cubic symmetric graphs

Low-density parity-check (LDPC) codes have been the subject of much interest due to the fact that they can perform near the Shannon limit. In this paper we present a construction of LDPC codes from cubic symmetric graphs. The constructed codes are $(3,3)$-regular and the vast majority of the corresponding Tanner graphs have girth greater than four. We analyse properties of the obtained codes and present bounds for the code parameters, the dimension and the minimum distance. Furthermore, we give an expression for the variance of the syndrome weight of the constructed codes. Information on the LDPC codes constructed from bipartite cubic symmetric graphs with less than 200 vertices is presented as well. Some of the constructed codes are optimal, and some have an additional property of being self-orthogonal or linear codes with complementary dual (LCD codes).