TY - GEN

T1 - Structured LDPC codes from permutation matrices free of small trapping sets

AU - Nguyen, Dung Viet

AU - Vasić, Bane

AU - Marcellin, Michael

AU - Chilappagari, Shashi Kiran

PY - 2010

Y1 - 2010

N2 - This paper introduces a class of structured low-density parity-check (LDPC) codes whose parity check matrices are arrays of permutation matrices. The permutation matrices are obtained from Latin squares and form a finite field under some matrix operations. They are chosen so that the Tanner graphs do not contain subgraphs harmful to iterative decoding algorithms. The construction of column-weight-three codes is presented. Although the codes are optimized for the Gallager A/B algorithm over the binary symmetric channel (BSC), their error performance is very good on the additive white Gaussian noise channel (AWGNC) as well.

AB - This paper introduces a class of structured low-density parity-check (LDPC) codes whose parity check matrices are arrays of permutation matrices. The permutation matrices are obtained from Latin squares and form a finite field under some matrix operations. They are chosen so that the Tanner graphs do not contain subgraphs harmful to iterative decoding algorithms. The construction of column-weight-three codes is presented. Although the codes are optimized for the Gallager A/B algorithm over the binary symmetric channel (BSC), their error performance is very good on the additive white Gaussian noise channel (AWGNC) as well.

UR - http://www.scopus.com/inward/record.url?scp=80051953637&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051953637&partnerID=8YFLogxK

U2 - 10.1109/CIG.2010.5592767

DO - 10.1109/CIG.2010.5592767

M3 - Conference contribution

AN - SCOPUS:80051953637

SN - 9781424482641

T3 - 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

BT - 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

T2 - 2010 IEEE Information Theory Workshop, ITW 2010

Y2 - 30 August 2010 through 3 September 2010

ER -