On ensembles of low-density parity-check codes: asymptotic distance distributions
From MaRDI portal
Publication:4674470
Recommendations
- Distance distributions in ensembles of irregular low-density parity-check codes
- On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
- Performance of low-density parity-check codes with linear minimum distance
- Asymptotic Enumeration Methods for Analyzing LDPC Codes
- On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles
Cited in
(15)- Distance Bounds for an Ensemble of LDPC Convolutional Codes
- Regular LPDC codes with guaranteed minimal Hamming distance
- Some Mysterious Sequences Associated with LDPC Codes
- Asymptotic Enumeration Methods for Analyzing LDPC Codes
- Low-complexity cryptographic hash functions
- Distance distributions in ensembles of irregular low-density parity-check 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
- The rate of regular ldpc codes
- Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity
- On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
- Iterative decoding of LDPC codes: some bounds and properties
- Extremal absorbing sets in low-density parity-check codes
- Average spectra and minimum distances of low-density parity-check codes over Abelian groups
This page was built for publication: On ensembles of low-density parity-check codes: asymptotic distance distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4674470)
