English
Related papers

Related papers: On a Class of Discrete Memoryless Broadcast Interf…

200 papers

A communication setup is considered where a transmitter wishes to convey a message to a receiver and simultaneously estimates the state of that receiver through a common waveform. The state is estimated at the transmitter by means of…

Information Theory · Computer Science 2022-06-03 Mehrasa Ahmadipour , Mari Kobayashi , Miche`le Wigger , Giuseppe Caire

We study the problem of communication over a discrete arbitrarily varying channel (AVC) when a noisy version of the state is known non-causally at the encoder. The state is chosen by an adversary which knows the coding scheme. A…

Information Theory · Computer Science 2018-04-30 Amitalok J. Budkuley , Sidharth Jaggi

This paper studies the capacity of the two-user intensity-modulation/direct-detection (IM/DD) interference channel (IC), which is relevant in the context of multi-user optical wireless communications. Despite some known single-letter…

Information Theory · Computer Science 2022-07-05 Zhenyu Zhang , Anas Chaaban

For discrete memoryless multiple-access channels, we propose a general definition of variable length codes with a measure of the transmission rates at the receiver side. This gives a receiver perspective on the multiple-access channel…

Information Theory · Computer Science 2011-02-28 Stephane Musy

Coding schemes for discrete memoryless multicast networks (DM-MN) with rate-limited feedback from the receivers and relays to the transmitter are proposed. The schemes improve over the noisy network coding proposed by Lim et al.. For the…

Information Theory · Computer Science 2016-11-17 Youlong Wu

We provide the degrees of freedom (DoF) characterization for the $3$-user $M_T\times M_R$ multiple-input multiple-output (MIMO) interference channel (IC) with \emph{rank-deficient} channel matrices, where each transmitter is equipped with…

Information Theory · Computer Science 2016-11-17 Yong Zeng , Xiaoli Xu , Yong Liang Guan , Erry Gunawan , Chenwei Wang

Partial ordering of communication channels has applications in performance analysis, and goes beyond comparisons of channels just on the basis of their Shannon capacity or error probability. Shannon defined a partial order of channel…

Information Theory · Computer Science 2021-05-07 Cihan Tepedelenlioglu

The fundamental diversity-multiplexing tradeoff (DMT) of the quasi-static fading, symmetric $2$-user MIMO interference channel (IC) with channel state information at the transmitters (CSIT) and a short term average power constraint is…

Information Theory · Computer Science 2010-06-08 Sanjay Karmakar , Mahesh K. Varanasi

In this work, we study the impact of imperfect sharing of the Channel State Information (CSI) available at the transmitters on a Network MIMO setting in which a set of $M$ transmit antennas, possibly not co-located, jointly serve two…

Information Theory · Computer Science 2020-05-14 Antonio Bazco-Nogueras , Arash Davoodi , Paul de Kerret , David Gesbert , Nicolas Gresset , Syed Jafar

A memoryless interference network model is introduced that is based on non-linear phenomena observed when transmitting information over optical fiber using wavelength division multiplexing. The main characteristic of the model is that…

Information Theory · Computer Science 2010-05-04 Hassan Ghozlan , Gerhard Kramer

This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme…

Information Theory · Computer Science 2013-04-04 Parthajit Mohapatra , Chandra R. Murthy

In this paper, we study capacity bounds for discrete memoryless broadcast channels with confidential messages. Two private messages as well as a common message are transmitted; the common message is to be decoded by both receivers, while…

Information Theory · Computer Science 2016-11-17 Jin Xu , Yi Cao , Biao Chen

The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k >= 3. We solve this problem for the case k=3. We prove that superposition coding is optimal for a class of…

Information Theory · Computer Science 2010-04-26 Chandra Nair , Zizhou Vincent Wang

In a premier paper on the information-theoretic analysis of a two-user cognitive interference channel(CIC), Devroye et al. presented an achievable rate region for the two-user discrete memoryless CIC. The coding scheme proposed by Devroye…

Information Theory · Computer Science 2015-09-22 Mostafa Monemizadeh

We consider the $K$-User Multiple-Input-Single-Output (MISO) Broadcast Channel (BC) where the transmitter, equipped with $M$ antennas, serves $K$ users, with $K \leq M$. The transmitter has access to a partial channel state information of…

Information Theory · Computer Science 2017-07-05 Enrico Piovano , Bruno Clerckx

A point-to-point integrated sensing and communication (ISAC) system is considered where a transmitter conveys a message to a receiver over a discrete memoryless channel (DMC) and simultaneously estimates the state of the channel through the…

Information Theory · Computer Science 2025-01-14 Homa Nikbakht , Michèle Wigger , Shlomo Shamai , H. Vincent Poor

A Gaussian interference channel (IC) aided by a half-duplex relay is considered, in which the relay receives and transmits in an orthogonal band with respect to the IC. The system thus consists of two parallel channels, the IC and the…

Information Theory · Computer Science 2016-11-17 Onur Sahin , Osvaldo Simeone , Elza Erkip

Joint detection and decoding (JDD) achieves rates based on information theory but is too complex to implement for many channels with memory or nonlinearities. Successive interference cancellation (SIC) at the receiver, combined with…

Information Theory · Computer Science 2025-01-15 Alex Jäger , Gerhard Kramer

This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…

Information Theory · Computer Science 2016-11-18 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

In this paper we provide an achievable rate region for the discrete memoryless multiple access channel with correlated state information known non-causally at the encoders using a random binning technique. This result is a generalization of…

Information Theory · Computer Science 2008-12-31 Tal Philosof , Ram Zamir , Uri Erez