Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles
From MaRDI portal
Publication:3548024
Recommendations
- Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles
- On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes
- Characterization of Elementary Trapping Sets in Irregular LDPC Codes and the Corresponding Efficient Exhaustive Search Algorithms
- Corrections to “On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes” [Sep 14 5188-5203]
- On the Construction of Structured LDPC Codes Free of Small Trapping Sets
- Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes With Applications to Stopping Sets
- Asymptotic Enumeration Methods for Analyzing LDPC Codes
- On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes
- From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes
- Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity
Cited in
(5)- Stopping Set Distribution of LDPC Code Ensembles
- QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field
- On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles
- Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity
- Multidimensional decoding networks for trapping set analysis
This page was built for publication: Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548024)
