Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
Abstract
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
arrow_leftView TOC
Email/Printer Friendly Format  
 

A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)
Cover, T.  

This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Mar 1975
Volume: 21,  Issue: 2
On page(s): 226- 228
ISSN: 0018-9448
Current Version Published: 2003-01-06

Abstract
If{(X_i, Y_i)}_{i=1}^{infty}is a sequence of independent identically distributed discrete random pairs with(X_i, Y_i) ~ p(x,y), Slepian and Wolf have shown that theXprocess and theYprocess can be separately described to a common receiver at ratesR_XandR_Yhits per symbol ifR_X + R_Y > H(X,Y), R_X > H(XmidY), R_Y > H(YmidX). 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{(X_i,Y_i)}_{i=1}^{infty}and countably infinite alphabets. The extension to an arbitrary number of processes is immediate.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
You are not logged in.
Guests may access Abstract records free of charge.
Login
Username
Password
» Forgot your password?
Please remember to log out when you have finished your session.
You must log in to access:
• Advanced or Author Search
• CrossRef Search
• AbstractPlus Records
• Full Text PDF
• Full Text HTML
Access this document
Full Text: PDF (512 KB)
» Buy this document now
»  Learn more about
»  Learn more about
    purchasing articles
    and standards

Rights and Permissions
» Learn More
Download this citation
Available to subscribers and IEEE members.
 
arrow_leftView TOC   |  Back to toparrow_up
Indexed by IEE Inspec
© Copyright 2009 IEEE – All Rights Reserved