Searching for Voltage Graph-Based LDPC Tailbiting Codes with Large Girth

Details Searching for Voltage Graph-Based LDPC Tailbiting Codes with Large Girth Searching for Voltage Graph-Based LDPC Tailbiting Codes with Large Girth

2011-08-03

arxiv.org/abs/1108.0840v1

Computer Science

Information Theory

Submitted to IEEE Transactions on Information Theory in February 2011

Scientific paper

10.1109/TIT.2011.2176717

The relation between parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Using the principle of tailbiting, compact representations of bipartite graphs based on convolutional codes can be found. Bounds on the girth and the minimum distance of LDPC block codes constructed in such a way are discussed. Algorithms for searching iteratively for LDPC block codes with large girth and for determining their minimum distance are presented. Constructions based on all-ones matrices, Steiner Triple Systems, and QC block codes are introduced. Finally, new QC regular LDPC block codes with girth up to 24 are given.

Affiliated with

Also associated with

No associations

Rating

Searching for Voltage Graph-Based LDPC Tailbiting Codes with Large 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 Searching for Voltage Graph-Based LDPC Tailbiting Codes with Large Girth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Searching for Voltage Graph-Based LDPC Tailbiting Codes with Large Girth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-664133