The following pages link to Imre Csiszár (Q796883):
Displaying 50 items.
- Sanov property, generalized I-projection and a conditional limit theorem (Q796884) (← links)
- Entropy splitting for antiblocking corners and perfect graphs (Q810528) (← links)
- Axiomatic characterizations of information measures (Q845363) (← links)
- A simple proof of Sanov's theorem (Q870462) (← links)
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems (Q1184223) (← links)
- I-divergence geometry of probability distributions and minimization problems (Q1222453) (← links)
- (Q1389261) (redirect page) (← links)
- Almost independence of random variables and capacity of a secrecy channel (Q1389262) (← links)
- Closures of exponential families (Q1775441) (← links)
- The consistency of the BIC Markov order estimator. (Q1848844) (← links)
- Generalized projections for non-negative functions (Q1897832) (← links)
- Generalized maximum likelihood estimates for exponential families (Q2480827) (← links)
- Consistent estimation of the basic neighborhood of Markov random fields (Q2493548) (← links)
- A class of measures of informativity of observation channels (Q2556388) (← links)
- MEASURING DISTRIBUTION MODEL RISK (Q2800000) (← links)
- An Information Geometry Problem in Mathematical Finance (Q2807544) (← links)
- Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities (Q2919489) (← links)
- Secrecy Generation for Multiaccess Channel Models (Q2989443) (← links)
- On Information Theoretic Security: Mathematical Models and Techniques (Q3002103) (← links)
- Capacity of the Gaussian arbitrarily varying channel (Q3197750) (← links)
- Some remarks on the dimension and entropy of random variables (Q3284986) (← links)
- On the error exponent of source-channel transmission with a distortion threshold (Q3309598) (← links)
- (Q3325618) (← links)
- (Q3339003) (← links)
- Limit relation for quantum entropy and channel capacity per unit cost (Q3544422) (← links)
- On Information Closures of Exponential Families: A Counterexample (Q3546740) (← links)
- Secrecy Capacities for Multiple Terminals (Q3546741) (← links)
- Context tree estimation for not necessarily finite memory processes, via BIC and MDL (Q3546742) (← links)
- Secrecy Capacities for Multiterminal Channel Models (Q3604594) (← links)
- Linear codes for sources and source networks: Error exponents, universal coding (Q3663167) (← links)
- (Q3669298) (← links)
- (Q3686615) (← links)
- Conditional limit theorems under Markov conditioning (Q3764957) (← links)
- (Q3772121) (← links)
- Arbitrarily varying channels with constrained inputs and states (Q3795606) (← links)
- The capacity of the arbitrarily varying channel revisited: positivity, constraints (Q3798585) (← links)
- (Q3815240) (← links)
- (Q3825909) (← links)
- Towards a general theory of source networks (Q3869237) (← links)
- (Q3901433) (← links)
- Feedback does not affect the reliability function of a DMC at rates above capacity (Corresp.) (Q3921142) (← links)
- Graph decomposition: A new key to coding theorems (Q3931313) (← links)
- On the capacity of the arbitrarily varying channel for maximum probability of error (Q3937283) (← links)
- Arbitrarily varying channels with general alphabets and states (Q4024550) (← links)
- (Q4035988) (← links)
- On the computation of rate-distortion functions (Corresp.) (Q4042978) (← links)
- (Q4060880) (← links)
- (Q4063033) (← links)
- A convergence of types theorem for probability measures on topological vector spaces with applications to stable laws (Q4148539) (← links)
- Broadcast channels with confidential messages (Q4160829) (← links)
