Abstract
We consider the two scenarios of communicating a pair S <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> , S <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> of distributed correlated sources over 2-user multiple access (MAC) and interference channels (IC), respectively. While in the MAC problem, the receiver needs to reconstruct both sources, in the IC problem, receiver j needs to reconstruct S <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3.</sub> We undertake a Shannon theoretic study and focus on characterizing sufficient conditions. Building on Dueck's findings (1981), we propose a coding scheme based on fixed block-length (B-L) codes. We characterize its information theoretic performance and characterize a new set of sufficient conditions. We identify examples of the MAC and IC problems for which the latter conditions are proven to be strictly weaker than the current known tightest.
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.
