A Combinatorial Family of Near Regular LDPC Codes

Details A Combinatorial Family of Near Regular LDPC Codes A Combinatorial Family of Near Regular LDPC Codes

2006-09-26

arxiv.org/abs/cs/0609146v1

ISIT 2007

Computer Science

Information Theory

5 pages 3 figures

Scientific paper

An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check codes achieving high girth is presented. The construction allows flexibility in the choice of design parameters like rate, average degree, girth and block length of the code and yields an asymptotic family. The complexity of constructing codes in the family grows only quadratically with the block length.

Affiliated with

Also associated with

No associations

Rating

A Combinatorial Family of Near Regular LDPC Codes 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 A Combinatorial Family of Near Regular LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Combinatorial Family of Near Regular LDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-260966