Why We Can Not Surpass Capacity: The Matching Condition

Details Why We Can Not Surpass Capacity: The Matching Condition Why We Can Not Surpass Capacity: The Matching Condition

2005-10-16

arxiv.org/abs/cs/0510045v1

Computer Science

Information Theory

10 pages, 27 ps figures. Forty-third Allerton Conference on Communication, Control and Computing, invited paper

Scientific paper

We show that iterative coding systems can not surpass capacity using only quantities which naturally appear in density evolution. Although the result in itself is trivial, the method which we apply shows that in order to achieve capacity the various components in an iterative coding system have to be perfectly matched. This generalizes the perfect matching condition which was previously known for the case of transmission over the binary erasure channel to the general class of binary-input memoryless output-symmetric channels. Potential applications of this perfect matching condition are the construction of capacity-achieving degree distributions and the determination of the number required iterations as a function of the multiplicative gap to capacity.

Affiliated with

Also associated with

No associations

Rating

Why We Can Not Surpass Capacity: The Matching Condition 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 Why We Can Not Surpass Capacity: The Matching Condition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Why We Can Not Surpass Capacity: The Matching Condition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-601217