engleski

On some results about LDPC codes based on cubic symmetric graphs and µ-geodetic graphs

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 shall define LDPC codes and present some of their important properties. We focus on the construction of LDPC codes without 4-cycles using adjacency matrices of cubic symmetric graphs and µ-geodetic graphs obtained from block designs. We will discuss some of the properties of the constructed codes, and moreover, present information on the constructed codes.

LDPC code ; cubic graph ; arc-transitive graph ; µ-geodetic graph

nije evidentirano