Exposing Pseudoweight Layers in Regular LDPC Code Ensembles

Details Exposing Pseudoweight Layers in Regular LDPC Code Ensembles Exposing Pseudoweight Layers in Regular LDPC Code Ensembles

2009-08-10

arxiv.org/abs/0908.1298v1

Computer Science

Information Theory

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

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Exposing Pseudoweight Layers in Regular LDPC Code Ensembles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exposing Pseudoweight Layers in Regular LDPC Code Ensembles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exposing Pseudoweight Layers in Regular LDPC Code Ensembles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-120433