Noisy-channel coding theorem
Limit on data transfer rate
In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise contamination of a communication channel, it is possible (in theory) to communicate discrete data (digital information) nearly error-free up to a computable maximum rate through the channel. This result was presented by Claude Shannon in 1948 and was based in part on earlier work and ideas of Harry Nyquist and Ralph Hartley.
Nº Q2345282 ★★
Uncommon · Knowledge
Noisy-channel coding theorem
Limit on data transfer rate
In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise contamination of a communication channel, it is possible (in theory) to communicate discrete data (digital information) nearly error-free up to a computable maximum rate through the channel. This result was presented by Claude Shannon in 1948 and was based in part on earlier work and ideas of Harry Nyquist and Ralph Hartley.
From Wikipedia
In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise contamination of a communication channel, it is possible (in theory) to communicate discrete data (digital information) nearly error-free up to a computable maximum rate through the channel. This result was presented by Claude Shannon in 1948 and was based in part on earlier work and ideas of Harry Nyquist and Ralph Hartley. The Shannon limit or Shannon capacity of a communication channel refers to the maximum rate of error-free data that can theoretically be transferred over the channel if the link is subject to random data transmission errors, for a particular noise level. It was first described by Shannon (1948), and shortly after published in a book by Shannon and Warren Weaver entitled The Mathematical Theory of Communication (1949). This founded the modern discipline of information theory.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
S
Shannon–Hartley theorem
Theorem that tells the maximum rate at which information can be transmitted
Nº Q1756194 ★★
Not listed
-
Claude Shannon
American mathematician and information theorist (1916–2001)
Nº Q92760 ★★★★
Not listed
-
Shannon–Fano coding
Technique for constructing a prefix code
Nº Q2645 ★
Not listed
-
S
Shannon's source coding theorem
Data compression theory
Nº Q2411312 ★★
Not listed
-
B
Betty Shannon
American mathematician
Nº Q33528466 ★
Not listed
-
S
Shannon (unit)
Unit of information
Nº Q15551713 ★
Not listed