TY - GEN
T1 - Trapping sets in irregular LDPC code ensembles
AU - Milenkovic, Olgica
AU - Soljanin, Emina
AU - Whiting, Philip
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33845569953&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33845569953&partnerID=8YFLogxK
U2 - 10.1109/ICC.2006.254894
DO - 10.1109/ICC.2006.254894
M3 - Conference contribution
AN - SCOPUS:33845569953
SN - 1424403553
SN - 9781424403554
T3 - IEEE International Conference on Communications
SP - 1101
EP - 1106
BT - 2006 IEEE International Conference on Communications, ICC 2006
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2006 IEEE International Conference on Communications, ICC 2006
Y2 - 11 July 2006 through 15 July 2006
ER -