Abstract
The capacity region for a multiple access channel (MAC) with arbitrary sets of common messages was derived by Han in 1979, extending a result by Slepian and Wolf from 1973. The general characterization by Han involves one auxiliary random variable per message and one inequality per subset of messages. In this paper, at first, a special hierarchy of common messages is identified for which the capacity region is characterized with generally fewer auxiliary random variables and inequalities. It is also shown that this characterization requires no auxiliary random variable for certain message structures. A procedure is then proposed to transform any common message structure to this special hierarchy, leading to a general capacity characterization which generally requires fewer auxiliary random variables than the one given by Han.
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.
