Elements of Information Theory
From MaRDI portal
asymptotic equipartition propertybroadcast channelchannel capacitychannel coding theoremChernoff boundcoding theoremcorrelated sourcesCramer Rao inequalitydata compressionerror probabilityFano's inequalityFisher informationGaussian channelhalting problemHamming codeshypothesis testinginference channelinformation theoryKolmogorov complexityKraft inequalitylarge deviation theorylaw of large numbersmaximum entropymethod of typesmulti-user information theorymultiple access channelnetwork information theoryNeyman Pearson lammaprobability theoryrate distortion theoryrelay channelShannon-Fano-Elias codingside informationSlepian-Wolf theoremsource codesspectral estimationthermodynamicsTuring machinetwo way channeluniversal coding
Statistical aspects of information-theoretic topics (62B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Information theory (general) (94A15) Measures of information, entropy (94A17) Rate-distortion theory in information and communication theory (94A34)
Recommendations
Cited in
(only showing first 100 items - show all)- Characterization of a complementary sensitivity property in feedback control: an information theoretic approach
- The coding complexity of Lévy processes
- Prediction, retrodiction, and the amount of information stored in the present
- Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
- An exploratory analysis approach for understanding variation in stochastic textured surfaces
- Ridge estimation of the VAR(1) model and its time series chain graph from multivariate time-course omics data
- Projection Pursuit Based on Gaussian Mixtures and Evolutionary Algorithms
- Dictator functions maximize mutual information
- Rényi entropy and complexity measure for skew-Gaussian distributions and related families
- General method to solve the heat equation
- The likely determines the unlikely
- Minimal perceptrons for memorizing complex patterns
- Inequality spectra
- Geometric algebra and information geometry for quantum computational software
- On statistical properties of Jizba-Arimitsu hybrid entropy
- Four aspects of superoscillations
- Adjusted regularization of cortical covariance
- Information-theoretic secret-key agreement: the asymptotically tight relation between the secret-key rate and the channel quality ratio
- Confidentiality and differential privacy in the dissemination of frequency tables
- Discovering patterns in time-varying graphs: a triclustering approach
- Computation of mutual information from hidden Markov models
- A ciphertext-size lower bound for order-preserving encryption with limited leakage
- Reconstruction methods for networks: the case of economic and financial systems
- Dynamical criticality in gene regulatory networks
- Informative input design for kernel-based system identification
- A note on predictive densities based on composite likelihood methods
- Degree-based entropies of networks revisited
- Integrative exploration of large high-dimensional datasets
- Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
- Asymptotics of insensitive load balancing and blocking phases
- The conditional entropy power inequality for bosonic quantum systems
- Capacity of a quantum memory channel correlated by matrix product states
- On weighted generalized cumulative residual entropy of order \(n\)
- Generalized information for the \(\gamma\)-order normal distribution
- A novel entropy-based decoding algorithm for a generalized high-order discrete hidden Markov model
- Lower bounds on the generalized central moments of the optimal alignments score of random sequences
- Open problems in universal induction \& intelligence
- Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees
- High metabolic demand in neural tissues: information and control theory perspectives on the synergism between rate and stability
- A unified definition of mutual information with applications in machine learning
- A robust cooperative spectrum sensing-assisted multiuser resource allocation scheme
- Uncertainty relations with quantum memory for the Wehrl entropy
- On the physical interpretation of statistical data from black-box systems
- Some properties of generalized Fisher information in the context of nonextensive thermostatistics
- Complementary variety: when can cooperation in uncertain environments outperform competitive selection?
- DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling
- When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack
- Why does deep and cheap learning work so well?
- Multi-period multi-criteria (MPMC) valuation of American options based on entropy optimization principles
- Latent tree models for hierarchical topic detection
- Structure and randomness of continuous-time, discrete-event processes
- Quantum limits on the entropy of bandlimited radiation
- Scalable information inequalities for uncertainty quantification
- Weighted entropy: basic inequalities
- Fluctuations when driving between nonequilibrium steady states
- UC-LTM: unidimensional clustering using latent tree models for discrete data
- Building up a robust risk mathematical platform to predict colorectal cancer
- On the information ratio of non-perfect secret sharing schemes
- A stability result for the cube edge isoperimetric inequality
- Swamping and masking in Markov boundary discovery
- Capacity of random channels with large alphabets
- Weighted entropy and optimal portfolios for risk-averse Kelly investments
- A generalized characterization of algorithmic probability
- Influential nodes ranking in complex networks: an entropy-based approach
- Measurement device-independent quantum dialogue
- Model distances for vine copulas in high dimensions
- Some logarithmic Minkowski inequalities for nonsymmetric convex bodies
- Synergy, redundancy, and multivariate information measures: an experimentalist's perspective
- rDAN: toward robust demand-aware network designs
- Simple strategies for semi-supervised feature selection
- Rearrangement algorithm and maximum entropy
- Symmetry breaking and the emergence of path-dependence
- Information-theoretic uncertainty of SCFG-modeled folding space of the non-coding RNA
- Multidimensional linear cryptanalysis
- Amplitude SNR limitation in control over channels with bounded noise
- LQG control of networked control systems with limited information
- Data reduction with quantization constraints for decentralized estimation in wireless sensor networks
- Information entropy- and average-based high-resolution digital storage oscilloscope
- Analytical properties of generalized Gaussian distributions
- Measure concentration and the weak Pinsker property
- An adaptive heuristic for feature selection based on complementarity
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs
- Partial monotonicity of entropy revisited
- Inattention and belief polarization
- A confidence-set approach to signal denoising
- Delayed mutual information infers patterns of synaptic connectivity in a proprioceptive neural network
- Quantum gravity, information theory and the CMB
- Reversibility and efficiency in coding protein information
- A hierarchical modulation coherent communication scheme for simultaneous four-state continuous-variable quantum key distribution and classical communication
- The PRIMPING routine -- tiling through proximal alternating linearized minimization
- Online estimation of discrete, continuous, and conditional joint densities using classifier chains
- Measurement uncertainty relations for discrete observables: relative entropy formulation
- Properties of two Shannon's ciphers
- Integer matrix approximation and data mining
- Relation between the rate of convergence of strong law of large numbers and the rate of concentration of Bayesian prior in game-theoretic probability
- A note on the chi-square method: a tool for proving cryptographic security
- New statistical models of nonergodic cognitive systems and their pathologies
- On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers
- Exact maximum-entropy estimation with Feynman diagrams
- Partisan intuition belies strong, institutional consensus and wide Zipf's law for voting blocs in US Supreme Court
This page was built for publication: Elements of Information Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5490912)
