engleski

On some LDPC codes

Low-density parity-check (LDPC) codes are a class of linear block codes that were first presented by Gallager in 1962. These codes have been the subject of much interest due to the fact that they can perform near Shannon limit. In this talk we study low-density parity-check (LDPC) codes having cubic semisymmetric graphs as their Tanner graphs. We will discuss some of the properties of the constructed codes and present bounds for the code parameters: code length, dimension and minimum distance. Moreover, information on the constructed codes, such as computational and simulation results, will be presented.

LDPC code, cubic graph, semisymmetric graph

nije evidentirano