TY - GEN
T1 - Trapping sets of structured LDPC codes
AU - Huang, Qin
AU - Diao, Qiuju
AU - Lin, Shu
AU - Abdel-Ghaffar, Khaled
PY - 2011
Y1 - 2011
N2 - THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. This paper analyzes trapping set structure of binary regular LDPC codes whose parity-check matrices satisfy the constraint that no two rows (or two columns) have more than one place where they both have non-zero components, which is called row-column (RC) constraint. For a (γ,ρ)-regular LDPC code whose parity-check matrix satisfies the RC-constraint, its Tanner graph contains no (κτ) trapping set with size κ ≤ γand number τ of odd degree check nodes less than γ. For several classes of RC-constrained regular LDPC codes constructed algebraically, we show that their Tanner graphs contain no trapping sets of sizes smaller than their minimum weights.
AB - THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. This paper analyzes trapping set structure of binary regular LDPC codes whose parity-check matrices satisfy the constraint that no two rows (or two columns) have more than one place where they both have non-zero components, which is called row-column (RC) constraint. For a (γ,ρ)-regular LDPC code whose parity-check matrix satisfies the RC-constraint, its Tanner graph contains no (κτ) trapping set with size κ ≤ γand number τ of odd degree check nodes less than γ. For several classes of RC-constrained regular LDPC codes constructed algebraically, we show that their Tanner graphs contain no trapping sets of sizes smaller than their minimum weights.
UR - https://www.scopus.com/pages/publications/80054822063
U2 - 10.1109/ISIT.2011.6033698
DO - 10.1109/ISIT.2011.6033698
M3 - 会议稿件
AN - SCOPUS:80054822063
SN - 9781457705953
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1086
EP - 1090
BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Y2 - 31 July 2011 through 5 August 2011
ER -