engleski

LDPC codes constructed from cubic symmetric graphs

Low-density parity-check (LDPC) codes were first presented by Gallager in 1962. and since then they have been the subject of much interest and study. In this talk we focus on the construction of LDPC codes using adjacency matrices of cubic symmetric graphs. We will discuss some of the properties of the constructed codes and present bounds for the code parameters. Moreover, information on the constructed codes will be presented.

LDPC code ; cubic graph ; arc-transitive graph ; bipartite graph

nije evidentirano