Asymptotic Enumeration Methods for Analyzing LDPC Codes
From MaRDI portal
Recommendations
- Finite-length analysis of low-density parity-check codes on the binary erasure channel
- On ensembles of low-density parity-check codes: asymptotic distance distributions
- Performance of low-density parity-check codes with linear minimum distance
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
- Distance distributions in ensembles of irregular low-density parity-check codes
Cited in
(12)- Identifying an unknown code by partial Gaussian elimination
- Analysis of the relation between properties of LDPC codes and the Tanner graph
- Fraud and data availability proofs: detecting invalid blocks in light clients
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
- Distance distributions in ensembles of irregular low-density parity-check codes
- Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles
- On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles
- Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity
- On ensembles of low-density parity-check codes: asymptotic distance distributions
- Finite-length analysis of low-density parity-check codes on the binary erasure channel
- Analytical Solution of Covariance Evolution for Irregular LDPC Codes
- Some Mysterious Sequences Associated with LDPC Codes
This page was built for publication: Asymptotic Enumeration Methods for Analyzing LDPC Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546624)