Weight Distributions of Regular Low-Density Parity-Check Codes over Finite Fields

Details Weight Distributions of Regular Low-Density Parity-Check Codes over Finite Fields Weight Distributions of Regular Low-Density Parity-Check Codes over Finite Fields

2010-10-11

arxiv.org/abs/1010.2030v3

IEEE Trans. Inf. Theory 57 (2011) 7507-7521

Computer Science

Information Theory

15 pages, 5 figures, accepted for publication in IEEE Transactions on Information Theory, July 2011

Scientific paper

10.1109/TIT.2011.2162642

The average weight distribution of a regular low-density parity-check (LDPC) code ensemble over a finite field is thoroughly analyzed. In particular, a precise asymptotic approximation of the average weight distribution is derived for the small-weight case, and a series of fundamental qualitative properties of the asymptotic growth rate of the average weight distribution are proved. Based on this analysis, a general result, including all previous results as special cases, is established for the minimum distance of individual codes in a regular LDPC code ensemble.

Affiliated with

Also associated with

No associations

Rating

Weight Distributions of Regular Low-Density Parity-Check Codes over Finite Fields 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 Weight Distributions of Regular Low-Density Parity-Check Codes over Finite Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weight Distributions of Regular Low-Density Parity-Check Codes over Finite Fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-658528