Category:Information theory

A

• [+] Algorithmic information theory (16 P)

C

• [+] Coding theory (4 C, 85 P)

D

• [+] Data compression (7 C, 63 P)
• [+] Data differencing (6 P)

D cont.

• [+] Detection theory (16 P)

E

• [+] Entropy and information (1 C, 32 P)
• [+] Error detection and correction (4 C, 82 P)

I

• [+] Information theorists (63 P)

N

• [+] Network performance (3 C, 74 P)

Q

• [+] Quantum information theory (1 C, 21 P)

*

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

3

• 3G MIMO

A

• Algorithmic information theory
• Ascendency
• Asymptotic equipartition property

B

• Bandwidth extension
• Bar product (coding theory)
• Frank Benford
• Bisection bandwidth
• Bra-ket notation

C

• Channel code
• Channel capacity
• Code rate
• Compressed sensing
• Computational irreducibility
• Conditional entropy
• Conditional mutual information
• Conjugate coding
• Constant-weight code
• Constraint (information theory)

D

• DISCUS
• DNA Dynamics
• Differential entropy
• Distributed source coding

E

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

F

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

G

• Gambling and information theory
• Gibbs' inequality
• Grammar-based code
• Grey relational analysis

H

• Hartley function
• Hirschman uncertainty
• History of information theory
• Hyper-encryption

I

• IEEE Transactions on Information Theory
• Implicit order
• Index of information theory articles
• Inequalities in information theory
• Infomania
• Infonomics
• Informating
• Information flow (information theory)
• Information algebra
• Information continuum
• Information diagram
• Information exchange
• Information geometry
• Information source (mathematics)
• Information theory and measure theory
• Information-action ratio
• Interaction information

J

• Joint source and channel coding
• Journal of Multimedia

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

M

• MIMO
• Many Antenna
• Map communication model
• A Mathematical Theory of Communication
• Maximum entropy spectral estimation
• Maximum entropy thermodynamics
• Metcalfe's law
• Min-entropy
• Minimum Fisher Information
• Modulo-N code
• Molecular models of DNA
• Multi-user MIMO
• Mutual information

N

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

O

• Observed information
• Operator Grammar
• Oversampling

P

• PU2RC
• 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 computer
• Quantum information
• Quantum spin model
• Quantum t-design

R

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

S

• Scale-Free Ideal Gas
• Self-dissimilarity
• Self-information
• Semiotic information theory
• Shannon index
• Shannon's source coding theorem
• Shannon–Hartley theorem
• Social Thermodynamics Theory
• Spatial multiplexing
• Spectral efficiency
• Structural information theory
• A Symbolic Analysis of Relay and Switching Circuits

T

• Theil index
• The Three-Process View
• Timeline of information theory
• Total correlation
• Tsallis entropy
• Typical set

U

• Unicity distance

Z

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