Change search
ReferencesLink to record
Permanent link

Direct link
Capacity of Two Semideterministic Classes of Multiple-Access Relay Channels
KTH, School of Electrical Engineering (EES), Communication Theory.
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0002-7926-5081
2012 (English)In: IEEE Communications Letters, ISSN 1089-7798, Vol. 16, no 10, 1529-1531 p.Article in journal (Refereed) Published
Abstract [en]

We investigate memoryless multiple-access relay channels (MARCs) and establish the capacity of two semideterministic classes of such channels: MARCs with orthogonal receive components and state-decoupled MARCs. For both cases, the achievability and converse are proved using the noisy network coding lower bound and the cutset upper bound, respectively. Finally, the capacity of a MARC with additive Gaussian interference is quantified.

Place, publisher, year, edition, pages
2012. Vol. 16, no 10, 1529-1531 p.
Keyword [en]
Capacity, noisy network coding, multiple-access relay channels, channels with state and additive interference
National Category
URN: urn:nbn:se:kth:diva-106149DOI: 10.1109/LCOMM.2012.092112.121289ISI: 000310339100001ScopusID: 2-s2.0-84867872131OAI: diva2:572950
ICT - The Next Generation
Available from: 2012-11-29 Created: 2012-11-29 Last updated: 2013-04-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Khormuji, Majid NasiriSkoglund, Mikael
By organisation
Communication Theory
In the same journal
IEEE Communications Letters

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 37 hits
ReferencesLink to record
Permanent link

Direct link