Tree-Based Construction of LDPC Codes

Details Tree-Based Construction of LDPC Codes Tree-Based Construction of LDPC Codes

2005-06-12

arxiv.org/abs/cs/0506042v1

Computer Science

Information Theory

5 pages, 12 figures. To appear in the Proceedings of IEEE International Symposium on Information Theory, Sept. 4-9, 2005, Adel

Scientific paper

We present a construction of LDPC codes that have minimum pseudocodeword weight equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on mutually orthogonal Latin squares to close the tree. Methods are presented for degrees d=p^s and d = p^s+1, for p a prime, -- one of which includes the well-known finite-geometry-based LDPC codes.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-526560