DocumentCode :
937209
Title :
A simple proof of the Ahlswede - Csiszár one-bit theorem (Corresp.)
Author :
Gamal, Abbas El
Volume :
29
Issue :
6
fYear :
1983
fDate :
11/1/1983 12:00:00 AM
Firstpage :
931
Lastpage :
933
Abstract :
It is proved that if 
are two finite alphabet correlated sources with 
for all 
, and if a function 
is 
-sensitive, then the rate 
of transmission from 
to 
necessary to compute reliably must be greater than 
. The same result holds if the function is highly sensitive and for every 
, then the number of elements 
with 
is different from one.
are two finite alphabet correlated sources with for all , and if a function is -sensitive, then the rate of transmission from to necessary to compute reliably must be greater than . The same result holds if the function is highly sensitive and for every , then the number of elements with is different from one.Keywords :
Information rates; Source coding; Covariance matrix; Decoding; Encoding; Entropy; Information theory; Inspection; Linear matrix inequalities; Matrix decomposition; Probability density function; Random variables;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1983.1056742
Filename :
1056742
Link To Document :
