Structured LDPC Codes from Permutation Matrices Free of Small Trapping Sets

Details Structured LDPC Codes from Permutation Matrices Free of Small Trapping Sets Structured LDPC Codes from Permutation Matrices Free of Small Trapping Sets

2010-04-07

arxiv.org/abs/1004.1198v1

Computer Science

Information Theory

5 pages, 3 figures, submitted to ITW Dublin 2010

Scientific paper

This paper introduces a class of structured lowdensity 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.

Affiliated with

Also associated with

No associations

Rating

Structured LDPC Codes from Permutation Matrices Free of Small Trapping Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Structured LDPC Codes from Permutation Matrices Free of Small Trapping Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Structured LDPC Codes from Permutation Matrices Free of Small Trapping Sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-712821