Noisy-channel coding theorem: Difference between revisions

Content deleted Content added
Mathematical statement: Graph showing the channel capacity based on noisiness
m Hartley
 
(2 intermediate revisions by 2 users not shown)
Line 1:
{{short description|Limit on data transfer rate}}
 
{{Information theory}}
 
{{redirect|Shannon's theorem|text=Shannon's name is also associated with the [[sampling theorem]]}}
Line 22 ⟶ 20:
== Mathematical statement ==
 
[[Image:Noisy-channel coding theorem — channel capacity graph.png|thumb|right|300px|Graph showing the proportion of a channel’s capacity (''y''-axis) that can be used for payload based on how noisy the channel is (probability of bit flips; ''x''-axis).]]
 
The basic mathematical model for a communication system is the following: