Exposing Pseudoweight Layers in Regular LDPC Code Ensembles

Mark F. Flanagan

Exposing Pseudoweight Layers in Regular LDPC Code Ensembles

Information Theory 2009-08-11 v1 math.IT

Authors: Mark F. Flanagan

Abstract

A solution is presented for the asymptotic growth rate of the AWGN-pseudoweight distribution of regular low-density parity-check (LDPC) code ensembles for a selected graph cover degree M >= 1. The evaluation of the growth rate requires solution of a system of 2M+1 nonlinear equations in 2M+1 unknowns. Simulation results for the pseudoweight distribution of two regular LDPC code ensembles are presented for graph covers of low degree.

Keywords

low-density parity-check codes graph theory graph algorithms

Cite

@article{arxiv.0908.1298,
  title  = {Exposing Pseudoweight Layers in Regular LDPC Code Ensembles},
  author = {Mark F. Flanagan},
  journal= {arXiv preprint arXiv:0908.1298},
  year   = {2009}
}

Comments

5 pages, 2 figures. In Proc. Information Theory Workshop 2009 (Taormina, Sicily)

Related papers

View all related →