Papalocal
Loading…
Papalocal · Things
Work

Noisy-channel coding theorem

Noisy-channel coding theorem is a limit on data transfer rate.

All 1 facts, and where they come from

Facts

1 facts · 0 confirmed by two sources · 0 cited · 1 from one source

What it is
theorem One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 16, 2026 · revision 2561112202
Described as
limit on data transfer rate
What it is
theorem
Wikipedias with a page
17

Wikidata item Q2345282 (wikidata.org/wiki/Q2345282), public domain (CC0). Copied 2026-11-16.

What Wikipedia says · copied November 16, 2026 · revision 1368754124

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.

From the Wikipedia article “Noisy-channel coding theorem” (en.wikipedia.org/wiki/Noisy-channel_coding_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-16; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it