Shannon channel coding theorem

Layer 0 — Mathematicsin the information-theory subtree

Shannon 1948: noisy-channel admits reliable communication at rate R iff R < C = max_p I(X;Y). Channel-capacity. Foundational; achieved by random-codes + LDPC + polar codes (Arıkan).

Related concepts

Explore Shannon channel coding theorem on the interactive knowledge graph →