Abstract
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 language | English |
---|---|
Title of host publication | 2006 IEEE International Conference on Communications, ICC 2006 |
Place of Publication | Piscataway, NJ |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 1101-1106 |
Number of pages | 6 |
Volume | 3 |
ISBN (Print) | 1424403553, 9781424403554 |
DOIs | |
Publication status | Published - 2006 |
Externally published | Yes |
Event | 2006 IEEE International Conference on Communications, ICC - 2006 - Istanbul, Turkey Duration: 11 Jul 2006 → 15 Jul 2006 |
Other
Other | 2006 IEEE International Conference on Communications, ICC - 2006 |
---|---|
Country/Territory | Turkey |
City | Istanbul |
Period | 11/07/06 → 15/07/06 |