Information Theory
Entropy, channel capacity, and coding theorems.
Information Theory addresses entropy, channel capacity, and coding theorems. It sits within Theoretical Foundations and inherits that area’s core questions about correctness, scale, and tractability. This page surveys the conceptual axes of the topic and points to the references that frame ongoing research and teaching. The intent is to be useful both as an entry point for newcomers and as an index for practitioners cross-checking their mental model against the field’s primary sources.
Work on information theory can be organised around a few interlocking concerns: the formal objects under study, the algorithms or systems that compute over them, the resource trade-offs (time, memory, communication, statistical efficiency), and the empirical or theoretical guarantees that practitioners rely on. The sources cited below approach the topic from a mix of these angles.
Foundational references
Cover, Elements of Information Theory (2006) is a standard reference for this material and is used both as a curriculum anchor and as a long-form survey of techniques. MacKay, Information Theory, Inference, and Learning Algorithms (2003) is a standard reference for this material and is used both as a curriculum anchor and as a long-form survey of techniques.
Historical context
A Mathematical Theory of Communication (Shannon, 1948) situates the topic in its historical trajectory; revisiting it clarifies which ideas in current practice are recent and which trace back to the field’s founding texts.
Open methodological questions in information theory cluster around how to compose the techniques above under realistic constraints — scale, adversarial inputs, partial observability, and shifting workloads. The cited references give the precise statements, proofs, and empirical evaluations that this overview only sketches; downstream topic pages drill into specific subfields.
Prerequisites
Sources
- textbook · primary · 2006Elements of Information Theorycover-2006
-
- textbook · primary · 2003Information Theory, Inference, and Learning Algorithmsmackay-2003
In context
Where this topic sits in the prerequisite graph. Click any node to jump.
Explore
- 01
Shannon Entropy
Entropy, mutual information, KL divergence, and basic identities.
- 02
Source Coding
Lossless compression, prefix codes, and Huffman/arithmetic coding.
- 03
Channel Coding
Capacity, Shannon's noisy channel theorem, and rate-distortion.
- 04
Error-Correcting Codes
Linear, Reed-Solomon, LDPC, and polar codes.
- 05
Algorithmic Information Theory
Kolmogorov complexity and incompressibility.
- 06
Quantum Information Theory
Von Neumann entropy, quantum channels, and quantum capacity.
Review this topic
This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.