Noisy-channel coding theorem: Difference between revisions

Content deleted Content added
Line 15:
The converse is also important. If
 
:<math> R > C \,</math>
 
the probability of error at the receiver increases without bound as the rate is increased. So no useful information can be transmitted beyond the channel capacity. The theorem does not address the rare situation in which rate and capacity are equal.