engleski

LDPC codes constructed from Moore graphs with diameter 2

The main subject of this talk are low-density parity-check (LDPC) codes based on adjacency matrices of strongly regular graphs with parameters (v, k, 0, 1). We will analyze absorbing set structures in the LDPC codes arising from the graphs. We will identify and enumerate the smallest absorbing sets in the Tanner graphs of the codes. Furthermore, we will give an expression for the variance of a syndrome weight of an LDPC code constructed from a strongly regular graph with parameters (v, k, 0, 1).

LDPC codes ; Moore graphs ; strongly regular graphs

nije evidentirano