Skip to content

Shannon–Hartley Theorem

Compute a noisy channel's maximum error-free bit rate as C = B·log₂(1 + S/N), a bound that is at once a wall no code can beat and a target codes can approach, linear in bandwidth but only logarithmic in signal-to-noise.

Core Idea

The Shannon–Hartley theorem gives the maximum error-free rate over a continuous channel of bandwidth B corrupted by additive white Gaussian noise: C = B·log₂(1 + S/N) bits per second. The formula is at once a hard converse — no code can sustain a higher rate — and an achievability certificate — rates arbitrarily close to C are attainable with long codes. It collapses all channel physics into two parameters, capacity being linear in bandwidth but only logarithmic in signal-to-noise.

Scope of Application

The exact formula applies literally wherever the precondition holds: a bandwidth-limited continuous channel with additive white Gaussian noise under a power constraint.

  • Wireline and DSL telephony — rate ceilings on twisted-pair channels against measured SNR.
  • Cellular radio (3G–5G) — each generation decomposed into bandwidth and SNR gains.
  • Wi-Fi and wireless LAN — bounds the error-free rate of each 20/40/80/160 MHz channel.
  • Optical fiber — capacity from bandwidth and optical signal-to-noise ratio.
  • Satellite and deep-space links — power-starved downlinks where spectrum, not power, pays.
  • Data storage — the write-read path treated as a noisy channel.

Clarity

The theorem pulls apart three quantities informal talk about "signal quality" runs together: bandwidth, signal-to-noise ratio, and the information rate they jointly permit. A link's throughput becomes a computed quantity with two separately-addressable inputs. Its dual character then tells an engineer exactly where effort pays: because C is a hard ceiling, chasing rates past it is impossible, while the gap to C is a real, measurable coding-quality figure.

Manages Complexity

An enormous object — antenna geometry, modulation, coding, interference, hardware — collapses for the throughput question to two scalars and one capacity. The engineer comparing fiber, satellite, and deep-space links computes B and S/N and reads off one number. The converse excludes an entire class of coding effort without trial, leaving exactly three levers: widen B, raise S/N, or narrow the residual coding gap.

Abstract Reasoning

The theorem licenses boundary-drawing via the converse (read C as an impossibility result and exclude effort without trial), a diagnostic via achievability (read the gap below C as closable coding distance), interventionist lever-selection with payoffs read off the linear/logarithmic asymmetry, cross-channel comparison and historical decomposition by one number, and a regime test on the noise model that scopes the exact formula to genuinely AWGN channels.

Knowledge Transfer

As a result rather than a mechanism, the theorem transfers by applying literally wherever its AWGN precondition holds — across every physical-layer link, as exact computation, not analogy, with the full reasoning kit intact. Where a channel is not AWGN-like (a neural pathway, an attentional bottleneck), the bandwidth-times-log shape travels only as an illuminating frame, and reporting a borrowed number as a Shannon–Hartley capacity over-reads it. The substrate-spanning lesson belongs to the parent channel_capacity — the maximum mutual information for any channel — which this theorem computes for one channel class.

Relationships to Other Abstractions

Local relationship map for Shannon–Hartley TheoremParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Shannon–HartleyTheoremDOMAINPrime abstraction: Channel Capacity — is a kind ofChannel CapacityPRIME

Current abstraction Shannon–Hartley Theorem Domain-specific

Parents (1) — more general patterns this builds on

  • Shannon–Hartley Theorem is a kind of Channel Capacity Prime

    Shannon-Hartley is the Gaussian continuous-channel specialization that computes the channel-capacity bound from bandwidth and signal-to-noise.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Shannon–Hartley Theorem sits in a sparse region of the domain-specific corpus (95th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (309 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-07-12