Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes

Details Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes

2011-06-07

arxiv.org/abs/1106.1414v1

Computer Science

Information Theory

To be presented at the 2011 IEEE International Symposium on Information Theory

Scientific paper

Ensembles of (J,K)-regular low-density parity-check convolutional (LDPCC) codes are known to be asymptotically good, in the sense that the minimum free distance grows linearly with the constraint length. In this paper, we use a protograph-based analysis of terminated LDPCC codes to obtain an upper bound on the free distance growth rate of ensembles of periodically time-varying LDPCC codes. This bound is compared to a lower bound and evaluated numerically. It is found that, for a sufficiently large period, the bounds coincide. This approach is then extended to obtain bounds on the trapping set numbers, which define the size of the smallest, non-empty trapping sets, for these asymptotically good, periodically time-varying LDPCC code ensembles.

Affiliated with

Also associated with

No associations

Rating

Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional 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 Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-27420