English
Related papers

Related papers: Fundamental Limits of Multiple-Access Integrated S…

200 papers

In this paper, we first study a two-user interference channel with generalized feedback. We establish an inner bound on its capacity region. The coding scheme that we employ for the inner bound is based on an appropriate combination of…

Information Theory · Computer Science 2016-11-15 Abdellatif Zaidi

We consider a broadcast channel with 3 receivers and 2 messages (M0, M1) where two of the three receivers need to decode messages (M0, M1) while the remaining one just needs to decode the message M0. We study the best known inner and outer…

Information Theory · Computer Science 2009-01-06 Chandra Nair , Vincent Wang Zizhou

This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

Information Theory · Computer Science 2013-03-11 Fangfang Zhu , Biao Chen

Several channels with asynchronous side information are introduced. We first consider single-user state-dependent channels with asynchronous side information at the transmitter. It is assumed that the state information sequence is a…

Information Theory · Computer Science 2016-01-19 Michal Yemini , Anelia Somekh-Baruch , Amir Leshem

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

In this paper, we consider fundamental communication limits over a compound channel. Covert communication in the information-theoretic context has been primarily concerned with fundamental limits when the transmitter wishes to communicate…

Information Theory · Computer Science 2019-06-18 Sadaf Salehkalaibar , Mohammad Hossein Yassaee , Vincent Y. F. Tan

We obtain new outer bounds on the capacity regions of the two-user multiple access channel with generalized feedback (MAC-GF) and the two-user interference channel with generalized feedback (IC-GF). These outer bounds are based on the idea…

Information Theory · Computer Science 2016-11-18 Ravi Tandon , Sennur Ulukus

The single-letter characterisation of the entanglement-assisted capacity of a quantum channel is one of the seminal results of quantum information theory. In this paper, we consider a modified communication scenario in which the receiver is…

Quantum Physics · Physics 2024-09-16 Kaiyuan Ji , Bartosz Regula , Mark M. Wilde

The problem of characterising the zero-error capacity region for multiple access channels even in the noiseless case has remained an open problem for over three decades. Motivated by this challenging question, a recently developed theory of…

Information Theory · Computer Science 2019-10-29 Ghassen Zafzouf , Girish N. Nair , Jamie S. Evans

In this paper, a two-user discrete memoryless multiple-access channel (DM-MAC) with correlated channel states, each known at one of the encoders is considered, in which each encoder transmits independent messages and tries to cooperate with…

Information Theory · Computer Science 2011-02-08 Mahdi Zamanighomi , Mohammad Javad Emadi , Farhad Shirani Chaharsooghi , Mohammad Reza Aref

A discrete time stochastic feedback control system with a noisy communication channel between the sensor and the controller is considered. The sensor has limited memory. At each time, the sensor transmits encoded symbol over the channel and…

Optimization and Control · Mathematics 2007-05-23 Aditya Mahajan , Demosthenis Teneketzis

We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar…

Information Theory · Computer Science 2017-08-09 Si-Hyeon Lee , Ligong Wang , Ashish Khisti , Gregory W. Wornell

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

This work considers a problem of integrated sensing and communication (ISAC) in which the goal of sensing is to detect a binary state. Unlike most approaches that minimize the total detection error probability, in our work, we disaggregate…

Information Theory · Computer Science 2025-02-03 Daewon Seo , Sung Hoon Lim

We explore the degrees of freedom (DoF) of three classes of finite state compound wireless networks in this paper. First, we study the multiple-input single-output (MISO) finite state compound broadcast channel (BC) with arbitrary number of…

Information Theory · Computer Science 2009-09-24 Tiangao Gou , Syed A. Jafar , Chenwei Wang

We study a joint communication and sensing setting comprising a transmitter, a receiver, and a sensor, all equipped with multiple antennas. The transmitter sends an encoded signal over the channel with the dual purpose of communicating an…

Information Theory · Computer Science 2026-03-19 Gökhan Yılmaz , Franz Lampel , Hamdi Joudeh , Giuseppe Caire

The problem of mismatched decoding for discrete memoryless channels is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods:…

Information Theory · Computer Science 2013-05-03 Anelia Somekh-Baruch

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…

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

We consider stability of scheduled multiaccess message communication with random coding and joint maximum-likehood decoding of messages. The framework we consider here models both the random message arrivals and the subsequent reliable…

Information Theory · Computer Science 2007-07-13 KCV Kalyanarama Sesha Sayee , Utpal Mukherji

We study the discrete memoryless Z-interference channel (ZIC) where the transmitter of the pair that suffers from interference is cognitive. We first provide an upper bound on the capacity of this channel. We then show that, when the…

Information Theory · Computer Science 2012-02-16 Nan Liu , Ivana Maric , Yinghui Cheng , Andrea J. Goldsmith , Shlomo Shamai