English
Related papers

Related papers: Adaptive Interference Coordination over Channels w…

200 papers

A covert communication system under block fading channels is considered where users experience uncertainty about their channel knowledge. The transmitter seeks to hide the covert communication to a private user by exploiting a legitimate…

Information Theory · Computer Science 2017-03-08 Khurram Shahzad , Xiangyun Zhou , Shihao Yan

Classically, communication systems are designed assuming perfect channel state information at the receiver and/or transmitter. However, in many practical situations, only an estimate of the channel is available that differs from the true…

Information Theory · Computer Science 2007-07-13 Pablo Piantanida , Gerald Matz , Pierre Duhamel

We consider the problem of estimating an upper bound on the capacity of a memoryless channel with unknown channel law and continuous output alphabet. A novel data-driven algorithm is proposed that exploits the dual representation of…

Information Theory · Computer Science 2024-01-25 Christian Häger , Erik Agrell

We consider the two-receiver memoryless broadcast channel with states where each receiver requests both common and private messages, and may know part of the private message requested by the other receiver as receiver message side…

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

We consider capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite…

Information Theory · Computer Science 2009-09-29 Haim Permuter , Tsachy Weissman , Andrea Goldsmith

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 considers the problem of covert communication with mismatched decoding, in which a sender wishes to reliably communicate with a receiver whose decoder is fixed and possibly sub-optimal, and simultaneously to ensure that the…

Information Theory · Computer Science 2021-11-11 Qiaosheng Zhang , Vincent Y. F. Tan

We derive the capacity region of the state-dependent semideterministic broadcast channel with noncausal state-information at the transmitter. One of the two outputs of this channel is a deterministic function of the channel input and the…

Information Theory · Computer Science 2012-11-14 Amos Lapidoth , Ligong Wang

In this paper, we consider the finite-state multiple access channel (MAC) with partially cooperative encoders and delayed channel state information (CSI). Here partial cooperation refers to the communication between the encoders via…

Information Theory · Computer Science 2016-11-17 Ziv Goldfeld , Haim H. Permuter , Benjamin M. Zaidel

The problem of fast point-to-point MIMO channel mutual information estimation is addressed, in the situation where the receiver undergoes unknown colored interference, whereas the channel with the transmitter is perfectly known. The…

Probability · Mathematics 2012-03-14 Abla Kammoun , Romain Couillet , Jamal Najim , Merouane Debbah

We study the covert communication over K-user discrete memoryless interference channels (DM-ICs) with a warden. It is assumed that the warden's channel output distribution induced by K "off" input symbols, which are sent when no…

Information Theory · Computer Science 2020-03-11 Kang-Hee Cho , Si-Hyeon Lee

Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full…

Information Theory · Computer Science 2021-01-08 Uzi Pereg , Christian Deppe , Holger Boche

Interference management in a three-user interference channel with alternating connectivity with only topological knowledge at the transmitters is considered. The network has a Wyner-type channel flavor, i.e., for each connectivity state the…

Information Theory · Computer Science 2013-10-10 Soheyl Gherekhloo , Anas Chaaban , Aydin Sezgin

We consider a two-user Gaussian multiple access channel with two independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. Transmitters are allowed to cooperate through…

Information Theory · Computer Science 2010-09-23 I-Hsiang Wang

Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about…

Information Theory · Computer Science 2013-03-21 Yuval Lomnitz , Meir Feder

Channel coding for discrete memoryless channels (DMCs) with mean and variance cost constraints has been recently introduced. We show that there is an improvement in coding performance due to cost variability, both with and without feedback.…

Information Theory · Computer Science 2025-07-10 Adeel Mahmood , Aaron B. Wagner

The secrecy capacity problems over the general arbitrarily varying wiretap channel (AVWC), with respect to the maximal decoding error probability and strong secrecy criterion, are considered, where the channel state sequence may be known or…

Information Theory · Computer Science 2017-12-05 Dan He , Yuan Luo

In this work we study the capacity of interference-limited channels with memory. These channels model non-orthogonal communications scenarios, such as the non-orthogonal multiple access (NOMA) scenario and underlay cognitive communications,…

Information Theory · Computer Science 2023-06-02 Ron Dabora , Emeka Abakasanga

This work addresses channel estimation in multiple antenna multicell interference-limited networks. Channel state information (CSI) acquisition is vital for interference mitigation. Wireless networks often suffer from multicell…

Information Theory · Computer Science 2015-05-11 Maha Alodeh , Symeon Chatzinotas , Bjorn Ottersten

The problem of identifying the channel with the highest capacity among several discrete memoryless channels (DMCs) is considered. The problem is cast as a pure-exploration multi-armed bandit problem, which follows the practical use of…

Information Theory · Computer Science 2024-01-19 Maximilian Egger , Rawad Bitar , Antonia Wachter-Zeh , Deniz Gündüz , Nir Weinberger
‹ Prev 1 8 9 10 Next ›