engleski

LDPC codes and cubic graphs

Low-density parity-check (LDPC) codes have been the focus of much research interest in the recent years and it has been shown that they perform close to the Shannon limit. The aim of this talk is to present the construction of families of LDPC codes using cubic graphs. For the construction, bipartite cubic symmetric and cubic semisymmetric graphs have been used. In the talk we will discuss some of the properties of the constructed codes and present information on the codes. Computational and simulation results will be presented as well.

LDPC code, cubic graph, symmetric graph, semisymmetric graph

nije evidentirano