Category:Information theory

A

• Algorithmic information theory (22 P)

C

• Coding theory (6 K, 119 P)

D

• Data compression (9 K, 191 P)
• Data differencing (1 K, 7 P)
• Detection theory (1 K, 10 P)

E

• Entropy and information (2 K, 42 P)
• Error detection and correction (6 K, 128 P)

I

• Information geometry (1 K, 5 P)
• Information theorists (1 K, 27 P)
• Information theory journals (1 P)

M

• Measures of complexity (1 K, 13 P)

N

• Network performance (8 K, 101 P)

Q

• Quantum computing (3 K, 88 P)
• Quantum information theory (2 K, 48 P)

S

• Similarity measures (2 K, 10 P)
• String metrics (14 P)

U

• Units of information (2 K, 46 P)

• Information theory

*

• Chain rule for Kolmogorov complexity
• Kolmogorov complexity

0–9

• 3G MIMO

A

• IMU Abacus Medal
• Adjusted mutual information
• Algorithmic information theory
• Ascendency
• Asymptotic equipartition property

B

• Bandwidth (computing)
• Bandwidth extension
• Bar product
• Frank Benford
• Berlekamp–Welch algorithm
• Bisection bandwidth
• Bra–ket notation
• Bretagnolle–Huber inequality

C

• Communication channel
• Channel capacity
• Channel state information
• Channel use
• Cheung–Marks theorem
• Cobham's theorem
• Code rate
• Common data model
• Communication complexity
• Communication source
• Compressed sensing
• Computational irreducibility
• Concatenated error correction code
• Conditional entropy
• Conditional mutual information
• Constant-weight code
• Constraint (information theory)
• Cooperative MIMO
• Cycles of Time

D

• Damerau–Levenshtein distance
• Differential entropy
• Directed information
• DISCUS
• Distributed source coding
• Dual total correlation

E

• Effective complexity
• Emotional selection (information)
• Entropic vector
• Entropy (information theory)
• Entropy estimation
• Entropy power inequality
• Entropy rate
• Error exponent
• Error exponents in hypothesis testing
• Everything is a file
• EXIT chart

F

• Fano's inequality
• Fisher information
• Formation matrix
• Fungible information

G

• Gambling and information theory
• Generalized distributive law
• Generalized entropy index
• Generalized minimum-distance decoding
• Gestalt pattern matching
• Gibbs' inequality
• Glossary of quantum computing
• Grammar-based code
• Grammatical Man
• Graph entropy
• Entropic gravity
• Grey relational analysis

H

• Hartley function
• Health information-seeking behaviour
• Entropic uncertainty
• History of information theory
• Homomorphic signatures for network coding
• Human information interaction
• Hyper-encryption

I

• Ideal tasks
• Identity channel
• IEEE Transactions on Information Theory
• Incompressibility method
• Index of information theory articles
• Inequalities in information theory
• Informating
• Information
• Information algebra
• Information behavior
• Information content
• Information continuum
• Information diagram
• Information dimension
• Information exchange
• Information flow (information theory)
• Information fluctuation complexity
• Information–action ratio
• Information projection
• Information source (mathematics)
• Information theory and measure theory
• Integrated information theory
• Interaction information
• Interactions of actors theory
• Interference channel

J

• Jakobson's functions of language
• Joint source and channel coding

K

• Kelly criterion
• Krichevsky–Trofimov estimator
• Kullback's inequality
• Karl Küpfmüller

L

• Lempel–Ziv complexity
• Limiting density of discrete points
• Linear partial information
• Locally recoverable code
• Log sum inequality
• Log-rank conjecture
• Logic of information
• Logical depth
• Lovász number

M

• Many antennas
• Map communication model
• A Mathematical Theory of Communication
• Maximal entropy random walk
• Maximal information coefficient
• Maximum entropy spectral estimation
• Maximum entropy thermodynamics
• Measure-preserving dynamical system
• Metcalfe's law
• MIMO
• MIMO-OFDM
• Minimum Fisher information
• Modulo-N code
• Multi-user MIMO
• Multicast-broadcast single-frequency network
• Multiparty communication complexity
• Mutual information

N

• Name collision
• Linear network coding
• Network performance
• Network throughput
• Noisy-channel coding theorem
• Nonextensive entropy
• Nyquist–Shannon sampling theorem
• Harry Nyquist

O

• Observed information
• One-way quantum computer
• Operator grammar
• Outage probability
• Oversampling

P

• Partial information decomposition
• Per-user unitary rate control
• Phase factor
• Pinsker's inequality
• Pointwise mutual information
• Pragmatic theory of information
• Principle of least privilege
• Privilege revocation (computing)
• Proebsting's paradox

Q

• Quantities of information
• Quantum capacity
• Quantum coin flipping
• Quantum computing
• Quantum t-design

R

• Random number generation
• Rate–distortion theory
• Receiver (information theory)
• Redundancy (information theory)
• Reed's law
• Relay channel
• Rényi entropy

S

• Sanov's theorem
• Self-dissimilarity
• Shannon capacity of a graph
• Shannon–Hartley theorem
• Shannon–Weaver model
• Claude Shannon
• Shannon's source coding theorem
• Shaping codes
• Shearer's inequality
• Spatial multiplexing
• Spatiotemporal pattern
• Specific-information
• Spectral efficiency
• Statistical manifold
• Structural information theory
• Surprisal analysis
• A Symbolic Analysis of Relay and Switching Circuits
• Szemerédi regularity lemma

T

• Theil index
• Three-process view
• Timeline of information theory
• Total correlation
• Triangular network coding
• Tsallis entropy
• Typical set

U

• Ulam's game
• Uncertainty coefficient
• Unicity distance

W

• Water filling algorithm
• Water-pouring algorithm
• Wilson's model of information behavior
• WSSUS model

Z

• Z-channel (information theory)