English
Related papers

Related papers: On the Sum Capacity of the Discrete Memoryless Int…

200 papers

We explore the capacity and generalized degrees of freedom of the two-user Gaussian X channel, i.e. a generalization of the 2 user interference channel where there is an independent message from each transmitter to each receiver. There are…

Information Theory · Computer Science 2008-10-28 Chiachi Huang , Viveck R. Cadambe , Syed A. Jafar

The capacity of a channel characterizes the maximum rate at which information can be transmitted through the channel asymptotically faithfully. For a channel with multiple senders and a single receiver, computing its sum capacity is…

Information Theory · Computer Science 2023-08-31 Akshay Seshadri , Felix Leditzky , Vikesh Siddhu , Graeme Smith

In this paper, we first present an outer bound for a general interference channel with a cognitive relay, i.e., a relay that has non-causal knowledge of both independent messages transmitted in the interference channel. This outer bound…

Information Theory · Computer Science 2015-03-17 Stefano Rini , Daniela Tuninetti , Natasha Devroye

We study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter…

Information Theory · Computer Science 2011-06-22 Ersen Ekrem , Sennur Ulukus

The interference channel models a wireless network where several source-destination pairs compete for the same resources. When nodes transmit simultaneously the destinations experience interference. This paper considers a 4-node network,…

Information Theory · Computer Science 2012-04-16 Daniela Tuninetti

The problem of identification over a discrete memoryless wiretap channel is examined under the criterion of semantic effective secrecy. This secrecy criterion guarantees both the requirement of semantic secrecy and of stealthy…

Information Theory · Computer Science 2025-02-27 Abdalla Ibrahim , Johannes Rosenberger , Boulat A. Bash , Christian Deppe , Roberto Ferrara , Uzi Pereg

In this paper, we characterize the capacity region for the two-user linear Gaussian compound Multiple Access Channel with common message (MACC) and with intersymbol interference (ISI) under an input power constraint. The region is obtained…

Information Theory · Computer Science 2012-12-19 Mostafa Monemizadeh , Saeed Hajizadeh , Seyed Alireza Seyedin , Ghosheh Abed Hodtani

We develop several lower bounds on the capacity of binary input symmetric output channels with synchronization errors which also suffer from other types of impairments such as substitutions, erasures, additive white Gaussian noise (AWGN)…

Information Theory · Computer Science 2012-03-30 Mojtaba Rahmati , Tolga M. Duman

The two-user Gaussian interference channel (G-IC) is revisited, with a particular focus on practically amenable discrete input signalling and treating interference as noise (TIN) receivers. The corresponding deterministic interference…

Information Theory · Computer Science 2021-03-18 Min Qiu , Yu-Chih Huang , Jinhong Yuan

The cognitive interference channel (C-IFC) consists of a classical two-user interference channel in which the message of one user (the "primary" user) is non-causally available at the transmitter of the other user (the "cognitive" user). We…

Information Theory · Computer Science 2016-11-18 Stefano Rini , Daniela Tuninetti , Natasha Devroye

We study a special case of Willems's two-user multi-access channel with partially cooperating encoders from a security perspective. This model differs from Willems's setup in that only one encoder, Encoder 1, is allowed to conference;…

Information Theory · Computer Science 2016-11-17 Zohaib Hassan Awan , Abdellatif Zaidi , Luc Vandendorpe

The capacity of a class of multi-way relay channels, where L users communicate via a relay (at possibly different rates), is derived for the case where the channel outputs are modular sums of the channel inputs and the receiver noise. The…

Information Theory · Computer Science 2011-11-16 Lawrence Ong , Sarah J. Johnson , Christopher M. Kellett

We consider a communication scenario over a discrete memoryless interference channel or multiple access channel without feedback, where transmitters exploit classical, quantum, or no-signaling cooperation. In this scenario, several previous…

Quantum Physics · Physics 2026-01-05 Seung-Hyun Nam , Hyun-Young Park , Jiyoung Yun , Ashutosh Rai , Si-Hyeon Lee , Joonwoo Bae

The two-user broadcast channel (BC) with receivers connected by bidirectional cooperation links of finite capacities, known as conferencing decoders, is considered. A novel capacity region outer bound is established based on multiple…

Information Theory · Computer Science 2025-08-12 Reza K. Farsani , Wei Yu

Optical wireless communication (OWC) using intensity-modulation and direct-detection (IM/DD) has a channel model which possesses unique features, due to the constraints imposed on the channel input. The aim of this tutorial is to overview…

Information Theory · Computer Science 2021-10-13 Anas Chaaban , Zouheir Rezki , Mohamed-Slim Alouini

In diffusion-based molecular communications, messages can be conveyed via the variation in the concentration of molecules in the medium. In this paper, we intend to analyze the achievable capacity in transmission of information from one…

Information Theory · Computer Science 2011-05-11 Arash Einolghozati , Mohsen Sardari , Ahmad Beirami , Faramarz Fekri

In this paper, we first consider a channel that is contaminated by two independent Gaussian noises $S ~ N(0,Q)$ and $Z_0 ~ N(0,N_0)$. The capacity of this channel is computed when independent noisy versions of $S$ are known to the…

Information Theory · Computer Science 2009-01-21 Yong Peng , Dinesh Rajan

This paper studies a layered erasure interference channel model, which is a simplification of the Gaussian interference channel with fading using the deterministic model approach. In particular, the capacity region of the layered erasure…

Information Theory · Computer Science 2009-09-08 Yan Zhu , Dongning Guo

We obtain a new upper bound on the capacity of a class of discrete memoryless relay channels. For this class of relay channels, the relay observes an i.i.d. sequence $T$, which is independent of the channel input $X$. The channel is…

Information Theory · Computer Science 2008-10-07 Ravi Tandon , Sennur Ulukus

We investigate the capacity region of multi-user interference channels (IC), where each user encodes multiple sub-user components. By unifying chain-rule decomposition with the Entropy Power Inequality (EPI), we reason that single-user…

Information Theory · Computer Science 2025-01-28 Sagnik Bhattacharya , Abhiram Rao Gorle , Muhammad Ali Mohsin , John M. Cioffi