Trapping sets in irregular LDPC code ensembles

Olgica Milenkovic, Emina Soljanin, Philip Whiting

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Trapping sets represent subgraphs in the Tanner graph of a code that, for certain classes of channels, exhibit a strong influence on the height and point of onset of the error-floor. We compute the asymptotic normalized distributions of trapping sets in random, irregular, binary low-density parity-check (LDPC) code ensembles. Our derivations rely on techniques from large deviation theory and statistical methods for enumerating random-like matrices. Similar methods can be used for computing the spectra of other combinatorial entities in LDPC code, such as subcodes and/or minimal codewords.

Original languageEnglish (US)
Title of host publication2006 IEEE International Conference on Communications, ICC 2006
Number of pages6
StatePublished - Dec 1 2006
Externally publishedYes
Event2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey
Duration: Jul 11 2006Jul 15 2006

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486


Other2006 IEEE International Conference on Communications, ICC 2006

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Trapping sets in irregular LDPC code ensembles'. Together they form a unique fingerprint.

Cite this