Abstract
A relay-assisted distributed source coding problem with three statistically correlated sources is formulated and studied. Natural lower bounds for the rates are presented. The lower bounds are shown to be achievable for three special classes of joint source distributions. The achievable coding strategies for the three special classes are observed to have markedly different characteristics. A special class for which the lower bounds are not achievable is presented. A single unified coding strategy which subsumes all four special classes is derived.
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.
