DocumentCode :
941597
Title :
A simple proof of the blowing-up lemma (Corresp.)
Author :
Marton, K.
Volume :
32
Issue :
3
fYear :
1986
fDate :
5/1/1986 12:00:00 AM
Firstpage :
445
Lastpage :
446
Abstract :
The blowing-up lemma says that if the probability with respect to a product measure of a set 
finite, 
large) is not exponentially small, then its 
-neighborhood has probability almost one for some 
. Here an information-theoretic proof of the blowing-up lemma, generalizing it to continuous alphabets, is given.
finite, large) is not exponentially small, then its -neighborhood has probability almost one for some . Here an information-theoretic proof of the blowing-up lemma, generalizing it to continuous alphabets, is given.Keywords :
Information theory; Arithmetic; Bridges; Error correction codes; Extraterrestrial measurements; Hamming distance; Information theory; Q measurement; Random variables; Welding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1986.1057176
Filename :
1057176
Link To Document :
