On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles

DOI10.1109/TIT.2006.880065MaRDI QIDQ3548076zbMATH OpenOpenAlexFDO

Authors Vishwambhar Rathi

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0512066

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Abstract: We estimate the variance of weight and stopping set distribution of regular LDPC ensembles. Using this estimate and the second moment method we obtain bounds on the probability that a randomly chosen code from regular LDPC ensemble has its weight distribution and stopping set distribution close to respective ensemble averages. We are able to show that a large fraction of total number of codes have their weight and stopping set distribution close to the average.

Recommendations

• Stopping Set Distribution of LDPC Code Ensembles
• On ensembles of low-density parity-check codes: asymptotic distance distributions
• Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles
• Asymptotic Enumeration Methods for Analyzing LDPC Codes
• Distance distributions in ensembles of irregular low-density parity-check codes

Cited in

(8)

• Distance distributions in ensembles of irregular low-density parity-check codes
• The rate of regular ldpc codes
• Stopping Set Distribution of LDPC Code Ensembles
• Average Coset Weight Distributions of Gallager's LDPC Code Ensemble
• Average Coset Weight Distribution of Combined LDPC Matrix Ensembles
• Average Stopping Set Weight Distributions of Redundant Random Ensembles
• On ensembles of low-density parity-check codes: asymptotic distance distributions
• Some Mysterious Sequences Associated with LDPC Codes

This page was built for publication: On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548076)