Related papers: Interference Networks with General Message Sets: A…
This paper establishes inner bounds on the secrecy capacity regions for the general 3-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be…
Throughput and per-packet delay can present strong trade-offs that are important in the cases of delay sensitive applications.We investigate such trade-offs using a random linear network coding scheme for one or more receivers in single hop…
This letter considers two groups of source nodes. Each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without…
We investigate the security of generalized quantum multiple-access channels. We provide the formula for the achievable rate region of secure communication in the scenario of two senders and a single receiver. We explicitly specify a…
In this paper, we propose a new coding scheme for symmetric Gaussian interference channels with feedback based on the ideas of time-varying coding schemes. The proposed scheme improves the Suh-Tse and Kramer inner bounds of the channel…
The two-user Multiple Access Channel (MAC) with cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A two-user MAC with common message (MACCM) and a two-user MAC with…
In this paper, we consider a distributed reception scenario where a transmitter broadcasts a signal to multiple geographically separated receive nodes over fading channels, and each node forwards a few bits representing a processed version…
In this paper, we present a general formula for the capacity region of a general interference channel with two pairs of users. The formula shows that the capacity region is the union of a family of rectangles, where each rectangle is…
Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages. The transmitter with extra knowledge is referred to as being cognitive. The inner…
By developing one-shot mutual covering lemmas, we derive a one-shot achievability bound for broadcast with a common message which recovers Marton's inner bound (with three auxiliary random variables) in the i.i.d.~case. The encoder employed…
We consider channel coding for Gaussian channels with the recently introduced mean and variance cost constraints. Through matching converse and achievability bounds, we characterize the optimal first- and second-order performance. The main…
The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K-user interference channel. In this paper, we introduce information…
With the booming development of generative artificial intelligence (GAI), semantic communication (SemCom) has emerged as a new paradigm for reliable and efficient communication. This paper considers a multi-user downlink SemCom system,…
This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two…
In the secure groupcast problem, a transmitter wants to securely groupcast a message with the maximum rate to the first $N$ of $K$ receivers by broadcasting with the minimum bandwidth, where the $K$ receivers are each equipped with a key…
Channel uncertainty and co-channel interference are two major challenges in the design of wireless systems such as future generation cellular networks. This paper studies receiver design for a wireless channel model with both time-varying…
Wireless Mesh network (WMN) is dynamically self-organizing and self-configured, with the nodes in the network automatically establishing an ad-hoc network and maintaining the mesh connectivity. The ability to use multiple-radios and…
This paper deals with the problem of massive random access for Gaussian multiple access channel (MAC). We continue to investigate the coding scheme for Gaussian MAC proposed by A. Vem et al in 2017. The proposed scheme consists of four…
Recent information-theoretic studies have resulted in several interference management (IM) techniques that promise significant capacity improvements over interference avoidance techniques. However, in practice, the stable throughput region…
In this paper, we analyze the Gaussian X channel in the mixed interference regime. In this regime, multiple access transmission to one of the receivers is shown to be close to optimal in terms of sum rate. Three upper bounds are derived for…