English
Related papers

Related papers: Achievable Rate Region for Multiple Access Channel…

200 papers

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Ivana Maric , Predrag Spasojevic , Roy D. Yates

This paper studies a Gaussian Z-interference channel with a rate-limited digital relay link from one receiver to another. Achievable rate regions are derived based on a combination of Han-Kobayashi common-private information splitting…

Information Theory · Computer Science 2012-04-26 Lei Zhou , Wei Yu

This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private…

Information Theory · Computer Science 2013-02-17 Ali Haghi , Reza K. Farsani , Mohammad Reza Aref , Farokh Marvasti

This paper investigates the secrecy capacity region of multiple access wiretap (MAC-WT) channels where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate…

Information Theory · Computer Science 2021-07-30 Hao Xu , Tianyu Yang , Kai-Kit Wong , Giuseppe Caire

A new applicable wiretap channel with separated side information is considered here which consist of a sender, a legitimate receiver and a wiretapper. In the considered scenario, the links from the transmitter to the legitimate receiver and…

Information Theory · Computer Science 2012-04-03 Hamid G. Bafghi , Babak Seyfe , Mahtab Mirmohseni , M. Reza Aref

In this paper, we investigate communication strategies for the multiple access channel with feedback and correlated sources (MACFCS). The MACFCS models a wireless sensor network scenario in which sensors distributed throughout an arbitrary…

Information Theory · Computer Science 2010-04-15 Lawrence Ong , Mehul Motani

In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver…

Information Theory · Computer Science 2016-11-17 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

A multiple-access channel is considered in which messages from one encoder are confidential. Confidential messages are to be transmitted with perfect secrecy, as measured by equivocation at the other encoder. The upper bounds and the…

Information Theory · Computer Science 2007-07-13 Ruoheng Liu , Ivana Maric , Roy D. Yates , Predrag Spasojevic

In this paper, we study the capacity of the two-user multiple-input multiple-output (MIMO) linear deterministic interference channel (IC), with possible correlations within/between the channel matrices. The capacity region is characterized…

Information Theory · Computer Science 2012-07-10 Xiaoli Xu , Yong Zeng , Yong Liang Guan , Tracey Ho

We study reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs). In MARCs only the destination is interested in reconstructing the sources,…

Information Theory · Computer Science 2016-11-17 Yonathan Murin , Ron Dabora , Deniz Gündüz

This work focuses on studying the half-duplex (HD) relaying in the Multiple Access Relay Channel (MARC) and the Compound Multiple Access Channel with a Relay (cMACr). A generalized Quantize-and-Forward (GQF) has been proposed to establish…

Information Theory · Computer Science 2014-01-15 Ming Lei , Mohammad Reza Soleymani

An achievable rate region for the Gaussian interference channel is derived using Sato's modified frequency division multiplexing idea and a special case of Han and Kobayashi's rate region (denoted by $\Gmat^\prime$). We show that the new…

Information Theory · Computer Science 2007-09-28 Xiaohu Shang , Biao Chen

In this paper, we investigate problems of communication over physically degraded, state-dependent broadcast channels (BCs) with cooperating decoders. Two different setups are considered and their capacity regions are characterized. First,…

Information Theory · Computer Science 2014-05-21 Lior Dikstein , Haim H. Permuter , Yossef Steinberg

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2008-03-31 Ender Tekin , Aylin Yener

In this paper we investigate the achievable rate of a system that includes a nomadic transmitter with several antennas, which is received by multiple agents, exhibiting independent channel gains and additive circular-symmetric complex…

Information Theory · Computer Science 2007-10-02 Amichai Sanderovich , Shlomo Shamai , Yossef Steinberg

In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…

Information Theory · Computer Science 2021-04-29 Zheng Li , Sheng Yang , Shlomo Shamai

In this paper, we present a new cooperative communication scheme consisting of two users in half-duplex mode communicating with one destination over a discrete memoryless channel. The users encode messages in independent blocks and divide…

Information Theory · Computer Science 2011-06-03 Ahmad Abu Al Haija , Mai Vu

The multiuser communication channel, in which multiple users exchange information with the help of a relay terminal, termed the multi-way relay channel (mRC), is introduced. In this model, multiple interfering clusters of users communicate…

Information Theory · Computer Science 2015-03-14 Deniz Gunduz , Aylin Yener , Andrea Goldsmith , H. Vincent Poor

This paper addresses the problem of computing the achievable rates for two (and three) users sharing a same frequency band without coordination and thus interfering with each other. It is thus primarily related to the field of cognitive…

Information Theory · Computer Science 2008-09-19 Abdoulaye Bagayoko , Patrick Tortelier

In this paper, we study the multiple-antenna wireless communication networks, where a large number of devices simultaneously communicate with an access point. The capacity region of multiple-input multiple-output massive multiple access…

Information Theory · Computer Science 2019-02-13 Fan Wei , Yongpeng Wu , Wen Chen , Wei Yang , Giuseppe Caire