Quasi-cyclic LDPC codes with high girth

Details Quasi-cyclic LDPC codes with high girth Quasi-cyclic LDPC codes with high girth

2009-06-18

arxiv.org/abs/0906.3410v1

Computer Science

Information Theory

Scientific paper

We study a class of quasi-cyclic LDPC codes. We provide precise conditions
guaranteeing high girth in their Tanner graph. Experimentally, the codes we
propose perform no worse than random LDPC codes with their same parameters,
which is a significant achievement for algebraic codes.

Affiliated with

Also associated with

No associations

Rating

Quasi-cyclic LDPC codes with high girth 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 Quasi-cyclic LDPC codes with high girth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasi-cyclic LDPC codes with high girth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-725719