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 ★★
Incomum · Saberes
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.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
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.
Texto: Wikipédia em inglês, CC BY-SA 4.0. ·
Cartas próximas
-
T
Teorema de Shannon–Hartley
Nº Q1756194 ★★
Sem ofertas
-
Claude Shannon
Nº Q92760 ★★★★
Sem ofertas
-
Codificação de Shannon-Fano
Algoritmos de compressão de dados
Nº Q2645 ★
Sem ofertas
-
T
Teorema de codificação da fonte
Nº Q2411312 ★★
Sem ofertas
-
B
Betty Shannon
Matemática norte-americana
Nº Q33528466 ★
Sem ofertas
-
S
Shannon (unit)
Unit of information
Nº Q15551713 ★
Sem ofertas