English
Related papers

Related papers: Two-User Erasure Interference Channels with Local …

200 papers

This work introduces capacity limits for molecular timing (MT) channels, where information is modulated in the release timing of small information particles, and decoded from the time of arrivals at the receiver. It is shown that the random…

Information Theory · Computer Science 2018-04-05 Nariman Farsad , Yonathan Murin , Andrew Eckford , Andrea Goldsmith

Movable antennas and reconfigurable intelligent surfaces enable a new paradigm in which channel statistics can be controlled and altered. Further, the known trajectory and operation protocol of communication satellites results in networks…

Information Theory · Computer Science 2024-05-30 Alireza Vahid , Shih-Chun Lin

Khanna and Sudan \cite{KS11} studied a natural model of continuous time channels where signals are corrupted by the effects of both noise and delay, and showed that, surprisingly, in some cases both are not enough to prevent such channels…

Information Theory · Computer Science 2012-05-15 Ioana Ivan , Michael Mitzenmacher , Justin Thaler , Henry Yuen

This paper gives the approximate capacity region of a two-user MIMO interference channel with limited receiver cooperation, where the gap between the inner and outer bounds is in terms of the total number of receive antennas at the two…

Information Theory · Computer Science 2014-07-08 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

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

A memoryless state-dependent broadcast channel (BC) is considered, where the transmitter wishes to convey two private messages to two receivers while simultaneously estimating the respective states via generalized feedback. The model at…

Information Theory · Computer Science 2020-11-09 Mehrasa Ahmadipour , Michèle Wigger , Mari Kobayashi

Recent studies have shown that retransmissions can cause heavy-tailed transmission delays even when packet sizes are light-tailed. Moreover, the impact of heavy-tailed delays persists even when packets size are upper bounded. The key…

Information Theory · Computer Science 2012-02-22 Yang Yang , Jian Tan , Ness B. Shroff , Hesham El-Gamal

This paper focuses on the capacity of peer-to-peer relay communications wherein the transmitter are assisted by an arbitrary number of parallel relays, i.e. there is no link and cooperation between the relays themselves. We detail the…

Information Theory · Computer Science 2014-04-08 Farshad Shams , Marco Luise

The problem of bistatic integrated sensing and communications over memoryless relay channels is considered, where destination concurrently decodes the message sent by the source and estimates unknown parameters from received signals with…

Information Theory · Computer Science 2026-03-05 Yao Liu , Min Li , Lawrence Ong , Aylin Yener

This paper is concerned with general interference channels characterized by a sequence of transition (conditional) probabilities. We present a general formula for the capacity region of the interference channel with two pairs of users. The…

Information Theory · Computer Science 2012-02-03 Lei Lin , Xiao Ma , Xiujie Huang , Baoming Bai

In this paper, we consider the discrete memoryless interference channel with common information, in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers. We derive an…

Information Theory · Computer Science 2007-07-13 Jinhua Jiang , Yan Xin , Hari Krishna Garg

We derive inner and outer bounds on the capacity region for a class of three-user partially connected interference channels. We focus on the impact of topology, interference alignment, and interplay between interference and noise. The…

Information Theory · Computer Science 2017-02-14 Muryong Kim , Yitao Chen , Sriram Vishwanath

We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive schemes, under a zero probability of error criterion. We derive single-letter inner and outer bounds for the zero-error capacity region,…

Information Theory · Computer Science 2021-09-13 Yujie Gu , Ofer Shayevitz

In this paper, we examine an input-constrained erasure channel and we characterize the asymptotics of its capacity when the erasure rate is low. More specifically, for a general memoryless erasure channel with its input supported on an…

Information Theory · Computer Science 2016-05-10 Yonglong Li , Guangyue Han

We study covert communications over binary-input discrete memoryless alarm two-way channels, in which two users interact through a two-way channel and attempt to hide the presence of their communication from an eavesdropping receiver. The…

Information Theory · Computer Science 2025-06-23 Tuna Erdoğan , Tyler Kann , Aria Nosratinia , Matthieu Bloch

In cognitive radio networks, when secondary users transmit in the null space of their interference channel with primary user, they can avoid interference. However, performance of this scheme depends on knowledge of channel state information…

Information Theory · Computer Science 2015-04-14 Shabnam Sodagari

A spectrum-sharing communication system where the secondary user is aware of the instantaneous channel state information (CSI) of the secondary link, but knows only the statistics and an estimated version of the secondary…

Information Theory · Computer Science 2015-03-20 Zouheir Rezk , Mohamed-Slim Alouini

The identification (ID) capacity region of the two-receiver broadcast channel (BC) is shown to be the set of rate-pairs for which, for some distribution on the channel input, each receiver's ID rate does not exceed the mutual information…

Information Theory · Computer Science 2017-06-02 Annina Bracher , Amos Lapidoth

We study the best known general inner bound[MAR '79] and outer bound[N-EG'07] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bound is identical to a weaker form of the outer…

Information Theory · Computer Science 2008-04-25 Chandra Nair , Vincent Wang Zizhou

We investigate the information theoretic limits of two types of state-dependent models in this dissertation. These models capture a wide range of wireless communication scenarios where there are interference cognition among transmitters.…

Information Theory · Computer Science 2018-07-26 Yunhao Sun