Uncommon

Shannon–Hartley theorem

Theorem that tells the maximum rate at which information can be transmitted

Shannon–Hartley theorem

Uncommon card · No. 195740

In information theory, the Shannon–Hartley theorem tells the maximum rate at which information can be transmitted over a communications channel of a specified bandwidth in the presence of noise. It is an application of the noisy-channel coding theorem to the archetypal case of a continuous-time analog communications channel subject to Gaussian noise. The theorem establishes Shannon's channel capacity for such a communication link, a bound on the maximum amount of error-free information per time unit that can be transmitted with a specified bandwidth in the presence of the noise interference, assuming that the signal power is bounded, and that the Gaussian noise process is characterized by a known power or power spectral density. The law is named after Claude Shannon and Ralph Hartley.

Read on Wikipedia

Open boosters, collect cards and trade them. Free to play.

Play for free
Shannon–Hartley theorem – Uncommon Wikipedia card | Wikiverse TCG