scientific article; zbMATH DE number 107482
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) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) 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)
- Elements of Information Theory
- Elements of underdetermined information theory
- scientific article; zbMATH DE number 5381394
- Information theory
- scientific article; zbMATH DE number 3937089
- scientific article; zbMATH DE number 3159838
- scientific article; zbMATH DE number 927559
- An Elementary Approach to the Theory of Information
- scientific article; zbMATH DE number 4116450
- scientific article; zbMATH DE number 3135403
- Symmetric measures via moments
- Complete monotonicity of the entropy in the central limit theorem for gamma and inverse Gaussian distributions
- Relative entropy measures applied to healthy and pathological voice characterization
- Motion identification from image sequences: Information theory and pixel selection
- WSE, a new sequence distance measure based on word frequencies
- Codification schemes and finite automata
- Entanglement assisted classical capacity of a class of quantum channels with long-term memory
- Object matching in disjoint cameras using a color transfer approach
- Sketching information divergences
- Semi-supervised graph clustering: a kernel approach
- Entropy of hidden Markov processes via cycle expansion
- Dimension of homogeneous rational self-similar measures with overlaps
- Signal-to-noise ratio performance limitations for input disturbance rejection in output feedback control
- Feature selection with dynamic mutual information
- Statistical mechanics of complex systems for pattern identification
- Generalization of Hilbert transform for symbolic analysis of noisy signals
- A general definition of conditional information and its application to ergodic decomposition
- Improved mixing time bounds for the Thorp shuffle and \(L\)-reversal chain
- The \(S\)-digraph optimization problem and the greedy algorithm
- Exploring the state sequence space for hidden Markov and semi-Markov chains
- Measuring the efficiency of the intraday Forex market with a universal data compression algorithm
- The Chernoff lower bound for symmetric quantum hypothesis testing
- Cryptanalysis of an E0-like combiner with memory
- Growth of strategy sets, entropy, and nonstationary bounded recall
- Classical capacity of quantum channels with general Markovian correlated noise
- Quantifying information leakage in process calculi
- Model, properties and imputation method of missing SNP genotype data utilizing mutual information
- Tracking and identification of regime-switching systems using binary sensors
- High resolution quantization and entropy coding of jump processes
- A refinement of the common cause principle
- Hypergraph decomposition and secret sharing
- New bounds on classical and quantum one-way communication complexity
- Global optimization of expensive-to-evaluate functions: An empirical comparison of two sampling criteria
- Characterizations based on Rényi entropy of order statistics and record values
- A low complexity robust detector in impulsive noise
- An overview of distinguishing attacks on stream ciphers
- Counting distinctions: on the conceptual foundations of Shannon's information theory
- Commitment and authentication systems
- Restructuring binary search trees revisited
- On the average depth of asymmetric LC-tries
- Compressing probability distributions
- Blind detection in symmetric non-Gaussian noise with unknown PDF using maximum entropy method with moment generating function constraints
- When cognitive diagnosis meets computerized adaptive testing: CD-CAT
- Some results on ordering of survival functions through uncertainty
- Numerical taxonomy and the principle of maximum entropy
- Averaging over decision trees
- Models, prior information, and Bayesian analysis
- Some aspects of the information theoretic dialogue
- Perfectly secure key distribution for dynamic conferences
- Optimal representation in average using Kolmogorov complexity
- Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution
- A strong approximation theorem for stochastic recursive algorithms
- Action-timing problem with sequential Bayesian belief revision process
- The space complexity of approximating the frequency moments
- On the stability of open networks: A unified approach by stochastic dominance
- Fluctuation spectroscopy
- On sparse approximations to randomized strategies and convex combinations
- Minimum entropy of error principle in estimation
- Computational depth and reducibility
- Testing for nonlinearity using redundancies: Quantitative and qualitative aspects
- The theory of search from a statistical viewpoint. (With discussion)
- The unicity distance: An upper bound on the probability of an eavesdropper successfully estimating the secret key
- State estimation with communication constraints
- Information and the clone mapping of chromosomes
- An information-theoretic approach to the design of a distributed cascade of sensors
- Information criteria for residual generation and fault detection and isolation
- Linking information reconciliation and privacy amplification
- Models of multi-user write-efficient memories and general diametric theorems
- Optimum measurements for discrimination among symmetric quantum states and parameter estimation
- On-line maximum likelihood prediction with respect to general loss functions
- Classification of binary vectors by stochastic complexity.
- Testing whether lifetime distribution is decreasing uncertainty
- Identification of deterministic chaos by an information-theoretic measure of the sensitive dependence on the initial conditions
- The finite sample properties of simultaneous equations' estimates and estimators. Bayesian and non-Bayesian approaches
- Performance study of marginal posterior density estimation via Kullback-Leibler divergence
- Mutual information, metric entropy and cumulative relative entropy risk
- State change, quantum probability, and information in operational phase-space measurement
- Tsallis entropy production for diffusion on the diluted hypercube
- Portfolio choice with endogenous utility: a large deviations approach.
- On finite strategy sets for finitely repeated zero-sum games.
- Sharing one secret vs. sharing many secrets.
- On the concept of best achievable compression ratio for lossy image coding.
- The generalized universal law of generalization.
- An approach to simple bargaining games and related problems
- Non-logarithmic Jensen-Shannon divergence
- A note on proximity of distributions in terms of coinciding moments.
- Multiscale entropy analysis of human gait dynamics
- Formulas for Rényi information and related measures for univariate distributions.
- Information flow on trees
- Estimation of the weights of interacting criteria from the set of profiles by means of information-theoretic functionals.
- A note on Kolmogorov complexity and entropy
- Some upper bounds for relative entropy and applications
- Sol Golomb's 60th birthday symposium. Papers from the symposium, Oxnard, CA, USA, May 29--31, 1992
- Maximal codeword lengths in Huffman codes
- The characterization of a measure of information discrepancy
- Min-wise independent permutations
- Information-theoretic determination of minimax rates of convergence
- Relative complexity changes in time series using information measures
- General properties and estimation of conditional Bernoulli models
- Applying MDL to learn best model granularity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023085)