Distance distributions in ensembles of irregular low-density parity-check codes

DOI10.1109/TIT.2003.820012MaRDI QIDQ3547291zbMATH OpenFDO

Authors Vladimir Shevelev, Simon Litsyn

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1109/TIT.2003.820012

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• On ensembles of low-density parity-check codes: asymptotic distance distributions
• On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
• Asymptotic Enumeration Methods for Analyzing LDPC Codes
• On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles
• Distance Bounds for an Ensemble of LDPC Convolutional Codes

Cited in

(8)

• On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
• Asymptotic Enumeration Methods for Analyzing LDPC Codes
• Average Coset Weight Distributions of Gallager's LDPC Code Ensemble
• Average Coset Weight Distribution of Combined LDPC Matrix Ensembles
• On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles
• Statistical physics of irregular low-density parity-check codes
• On ensembles of low-density parity-check codes: asymptotic distance distributions
• Average spectra and minimum distances of low-density parity-check codes over Abelian groups

This page was built for publication: Distance distributions in ensembles of irregular low-density parity-check codes

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