Tradeoff between decoding complexity and rate for codes on graphs

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We consider transmission over a general memoryless channel, with bounded decoding complexity per bit under message passing decoding. We show that the achievable rate is bounded below capacity if there is a finite success in the decoding in a specified number of operations per bit at the decoder for some codes on graphs. These codes include LDPC and LDGM codes. Good performance with low decoding complexity suggests strong local structures in the graphs of these codes, which are detrimental to the code rate asymptotically. The proof method leads to an interesting necessary condition on the code structures which could achieve capacity with bounded decoding complexity. We also show that if a code sequence achieves a rate epsilon close to the channel capacity, the decoding complexity scales at least as O(log(1/epsilon).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Tradeoff between decoding complexity and rate for codes on graphs 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 Tradeoff between decoding complexity and rate for codes on graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tradeoff between decoding complexity and rate for codes on graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-409493

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.