Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes

Details Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes

2008-04-28

arxiv.org/abs/0804.4466v1

Computer Science

Information Theory

6 pages, 4 figures, 1 table

Scientific paper

In this paper asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protograph-based LDPC convolutional codes. In particular, we show that the free distance to constraint length ratio of the regular LDPC convolutional codes exceeds that of the minimum distance to block length ratio of the corresponding LDPC block codes.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-692307