Capacity Achieving Low Density Parity Check Lattices

Details Capacity Achieving Low Density Parity Check Lattices Capacity Achieving Low Density Parity Check Lattices

2010-04-10

arxiv.org/abs/1004.1749v4

Computer Science

Information Theory

This paper has been withdrawn by the author due to an error

Scientific paper

The concept and existence of sphere-bound-achieving and capacity-achieving lattices has been explained on AWGN channels by Forney. LDPC lattices, introduced by Sadeghi, perform very well under iterative decoding algorithm. In this work, we focus on an ensemble of regular LDPC lattices. We produce and investigate an ensemble of LDPC lattices with known properties. It is shown that these lattices are sphere-bound-achieving and capacity-achieving. As byproducts we find the minimum distance, coding gain, kissing number and an upper bound for probability of error for this special ensemble of regular LDPC lattices.

Affiliated with

Also associated with

No associations

Rating

Capacity Achieving Low Density Parity Check Lattices 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 Capacity Achieving Low Density Parity Check Lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity Achieving Low Density Parity Check Lattices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-186300