DocumentCode :
923058
Title :
A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)
Author :
Cover, Thomas M.
Volume :
21
Issue :
2
fYear :
1975
fDate :
3/1/1975 12:00:00 AM
Firstpage :
226
Lastpage :
228
Abstract :
If 
is a sequence of independent identically distributed discrete random pairs with 
, Slepian and Wolf have shown that the 
process and the 
process can be separately described to a common receiver at rates 
and 
hits per symbol if 
. A simpler proof of this result will be given. As a consequence it is established that the Slepian-Wolf theorem is true without change for arbitrary ergodic processes 
and countably infinite alphabets. The extension to an arbitrary number of processes is immediate.
is a sequence of independent identically distributed discrete random pairs with , Slepian and Wolf have shown that the process and the process can be separately described to a common receiver at rates and hits per symbol if . A simpler proof of this result will be given. As a consequence it is established that the Slepian-Wolf theorem is true without change for arbitrary ergodic processes and countably infinite alphabets. The extension to an arbitrary number of processes is immediate.Keywords :
Data compression; Source coding; Application software; Convolutional codes; Data compression; Decoding; Error correction; Frequency; Laboratories; Pattern recognition; Telephony; Viterbi algorithm;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1975.1055356
Filename :
1055356
Link To Document :
