Abstract
This paper is concerned with the capacity of Gaussian orthogonal multi-access relay channel (OMARC) where multiple sources communicate with one destination in the presence of one relay. The achievability proof and converse for the capacity of Gaussian OMARC are given by e-entropy-typical sequences and cut-set upper bound, respectively. The capacity of Gaussian OMARC is shown to have a max-flow min-cut interpretation.
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.
