Exposing Pseudoweight Layers in Regular LDPC Code Ensembles

2009/08/10 by Mark F. Flanagan, Flanagan, Mark F.
Computer Science · Engineering · #Advanced MIMO Systems Optimization #Advanced Wireless Communication Technologies #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.0908.1298

openalex publication_date 2009/08/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes

Related

• Free Pseudodistance Growth Rates for Spatially Coupled LDPC Codes over the BEC
• On the Growth Rate of the Weight Distribution of Irregular Doubly-Generalized LDPC Codes
• The polynomial error probability for LDPC codes
• Optimized puncturing distributions for irregular non-binary LDPC codes
• On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles