A Simple Proof of the Blowing-Up Lemma

IEEE Transactions on Information Theory

Volumn 32, Issue 3, 1986, Pages 445-446

  Marton, K ^a  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - COMBINATORIAL MATHEMATICS; PROBABILITY;

BLOWING-UP LEMMA; COMBINATORIAL LEMMA; CONTINUOUS ALPHABETS;

INFORMATION THEORY;

EID: 0022720166     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1986.1057176     Document Type: Article

References (7)

1. I. Csiszar and J. Körner, Information Theory. Coding Theorems for Discrete Memory less Systems Budapest: Akademiai Kiado and New York: Academic Press.
2. D. Rudolph, “If a two-point extension of a Bernoulli shift has an ergodic square than it is Bernoulli,” Israel J. Math., vol. 30, pp. 159–180, 1978.
3. R. Ahlswede, P. Gács, and J. Körner, “Bounds on conditional probabilities with applications in multi-user communication,” Z. Wahrschein-lichketistheorie u. verw. Geh., vol. 34, pp. 157–177, 1976.
4. G. Margulis, “Probabilistic characteristics of graphs with large connectivity,” (in Russian), Prob. Pered. Inform, vol. 10, no. 2, pp. 101–108, 1974.
5. D. Ornstein, Ergodic Theory, Randomness and Dynamical Systems. New Haven, CT: Yale Univ. Press.
6. V. Strassen, “The existence of probability measures with given marginals,” Ann. Math. Statist., vol. 36, pp. 423–439, 1965.
7. I. Csiszar, “Sanov property, generalized /-projection and a conditional limit theorem,” Ann. Prob., vol. 12, pp. 768–793, 1984.