Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles
From MaRDI portal
Publication:3548024
DOI10.1109/TIT.2006.887060zbMATH Open1310.94215OpenAlexW2153344955MaRDI QIDQ3548024
Author name not available (Why is that?)
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.2006.887060
Related Items (1)
Recommendations
- Corrections to “On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes” [Sep 14 5188-5203] 👍 👎
- On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes 👍 👎
- Asymptotic Enumeration Methods for Analyzing LDPC Codes 👍 👎
- Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity 👍 👎
- Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes With Applications to Stopping Sets 👍 👎
- Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles 👍 👎
- 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 👍 👎
- On the Construction of Structured LDPC Codes Free of Small Trapping Sets 👍 👎
- On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes 👍 👎
- Characterization of Elementary Trapping Sets in Irregular LDPC Codes and the Corresponding Efficient Exhaustive Search Algorithms 👍 👎
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)
