Category:Information theory

A

• ► Algorithmic information theory‎ (16 P)

C

• ► Coding theory‎ (6 C, 110 P)

D

• ► Data compression‎ (7 C, 69 P)
• ► Data differencing‎ (9 P)
• ► Detection theory‎ (10 P)

E

• ► Entropy and information‎ (2 C, 31 P)
• ► Error detection and correction‎ (5 C, 115 P)

I

• ► Information theorists‎ (1 C, 15 P)

M

• ► Measures of complexity‎ (8 P)

N

• ► Network performance‎ (5 C, 101 P)

Q

• ► Quantum information theory‎ (1 C, 28 P)

S

• ► String similarity measures‎ (16 P)

U

• ► Units of information‎ (1 C, 61 P)

*

• Chain rule for Kolmogorov complexity
• Information theory
• Kolmogorov complexity

3

• 3G MIMO

A

• Adjusted mutual information
• Algorithmic information theory
• Ascendency
• Asymptotic equipartition property

B

• Bandwidth extension
• Bar product (coding theory)
• Frank Benford
• Berlekamp–Welch algorithm
• Bisection bandwidth
• Bra–ket notation

C

• Channel (communications)
• Channel capacity
• Channel code
• Channel state information
• Channel use
• Cheung–Marks theorem
• Code rate
• Communication source
• Compressed sensing
• Computational irreducibility
• Concatenated error correction code
• Conditional entropy
• Conditional mutual information
• Conjugate coding
• Constant-weight code
• Constraint (information theory)
• Cycles of Time (book)

D

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

E

• Effective complexity
• Entropic vector
• Entropy (information theory)
• Entropy estimation
• Entropy power inequality
• Entropy rate
• Error exponent
• Everything is a file
• Exformation
• EXIT chart
• Extreme physical information

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
• Gibbs' inequality
• Grammar-based code
• Grammatical man

G cont.

• Entropic gravity
• Grey relational analysis

H

• Hartley function
• Entropic uncertainty
• History of information theory
• Homomorphic signatures for network coding
• Hyper-encryption

I

• Identity channel
• IEEE Information Theory Society
• IEEE Transactions on Information Theory
• Implicit order
• Index of information theory articles
• Inequalities in information theory
• Infonomics
• Informating
• Information algebra
• Information continuum
• Information diagram
• Information exchange
• Information flow (information theory)
• Information geometry
• Information projection
• Information seeking behavior
• Information source (mathematics)
• Information theory and measure theory
• Information–action ratio
• Interaction information

J

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

K

• Kelly criterion
• Kullback's inequality
• Karl Küpfmüller

L

• LIFO (computing)
• Limiting density of discrete points
• Linear partial information
• Log sum inequality
• Logic of information
• Logical depth
• Lovász number

M

• Many antennas
• Map communication model
• A Mathematical Theory of Communication
• Maximal information coefficient
• Maximum entropy spectral estimation
• Maximum entropy thermodynamics
• Metcalfe's law
• MIMO
• 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
• Nevanlinna Prize
• Noisy-channel coding theorem

N cont.

• Nonextensive entropy
• Harry Nyquist
• Nyquist–Shannon sampling theorem

O

• Observed information
• Operator grammar
• Oversampling

P

• Phase factor
• Physical information
• Pinsker's inequality
• Pointwise mutual information
• Pragmatic theory of information
• Principle of least privilege
• Privilege revocation
• Proebsting's paradox

Q

• Quantities of information
• Quantum capacity
• Quantum computer
• Quantum t-design

R

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

S

• Sanov's theorem
• Scale-free ideal gas
• Self-dissimilarity
• Self-information
• Semiotic information theory
• Shannon's source coding theorem
• Shannon–Hartley theorem
• Shannon–Weaver model
• Shaping codes
• Shearer's inequality
• Social thermodynamics theory
• Spatial multiplexing
• Specific-information
• Spectral efficiency
• Structural information theory
• Surprisal Analysis
• A Symbolic Analysis of Relay and Switching Circuits

T

• Theil index
• The 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
• WSSUS model

Z

• Z-channel (information theory)
• Zero suppression
• Zero-forcing precoding
• Zyablov bound