Abstract
In this paper we investigate the relationship between Slepian-Wolf (S-W) coding and channel coding. It is shown that any S-W coding problem is dual to a channel coding problem for a semi-symmetric channel. This result holds for any stationary, ergodic source-side information pair with finite alphabet.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
