LDPC Codes from Latin Squares Free of Small Trapping Sets

Details LDPC Codes from Latin Squares Free of Small Trapping Sets LDPC Codes from Latin Squares Free of Small Trapping Sets

2010-08-24

arxiv.org/abs/1008.4177v2

Computer Science

Information Theory

This is a 21 page paper. It contains 18 figures and 4 tables. This paper was submitted to IEEE Transactions on Information The

Scientific paper

This paper is concerned with the construction of low-density parity-check (LDPC) codes with low error floors. Two main contributions are made. First, a new class of structured LDPC codes is introduced. The parity check matrices of these codes are arrays of permutation matrices which are obtained from Latin squares and form a finite field under some matrix operations. Second, a method to construct LDPC codes with low error floors on the binary symmetric channel (BSC) is presented. Codes are constructed so that their Tanner graphs are free of certain small trapping sets. These trapping sets are selected from the Trapping Set Ontology for the Gallager A/B decoder. They are selected based on their relative harmfulness for a given decoding algorithm. We evaluate the relative harmfulness of different trapping sets for the sum product algorithm (SPA) by using the topological relations among them and by analyzing the decoding failures on one trapping set in the presence or absence of other trapping sets.

Affiliated with

Also associated with

No associations

Rating

LDPC Codes from Latin Squares 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 LDPC Codes from Latin Squares Free of Small Trapping Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and LDPC Codes from Latin Squares Free of Small Trapping Sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524606