English
Related papers

Related papers: The Two-User Deterministic Interference Channel wi…

200 papers

The listsize capacity of a discrete memoryless channel is the largest transmission rate for which the expectation---or, more generally, the $\rho$-th moment---of the number of messages that could have produced the output of the channel…

Information Theory · Computer Science 2014-10-16 Christoph Bunte , Amos Lapidoth

We derive the capacity region of arbitrarily varying multiple-access channels with conferencing encoders for both deterministic and random coding. For a complete description it is sufficient that one conferencing capacity is positive. We…

Information Theory · Computer Science 2012-11-21 Moritz Wiese , Holger Boche

Most communication systems use some form of feedback, often related to channel state information. The common models used in analyses either assume perfect channel state information at the receiver and/or noiseless state feedback links.…

Information Theory · Computer Science 2014-07-15 Vaneet Aggarwal , Ashutosh Sabharwal

For a stationary additive Gaussian-noise channel with a rational noise power spectrum of a finite-order $L$, we derive two new results for the feedback capacity under an average channel input power constraint. First, we show that a very…

Information Theory · Computer Science 2007-07-13 Shaohua Yang , Aleksandar Kavcic , Sekhar Tatikonda

We study the performance of a cognitive system modeled by one secondary and one primary link and operating under statistical quality of service (QoS) delay constraints. We analyze the effective capacity (EC) to quantify the secondary user…

Information Theory · Computer Science 2014-06-23 M. Majid Butt , Ahmed Anwar , Amr Mohamed , Tamer ElBatt

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…

Information Theory · Computer Science 2012-09-06 Fangfang Zhu , Xiaohu Shang , Biao Chen , H. Vincent Poor

Computing channel capacity is in general intractable because it is given by the limit of a sequence of optimization problems whose dimensionality grows to infinity. As a result, constant-sized characterizations of feedback or non-feedback…

Information Theory · Computer Science 2025-07-15 Eray Unsal Atay , Eitan Levin , Venkat Chandrasekaran , Victoria Kostina

This paper investigates three open problems in random beamforming based communication systems: the scheduling policy with heterogeneous users, the closed form sum rate, and the randomness of multiuser diversity with selective feedback. By…

Information Theory · Computer Science 2016-11-17 Yichao Huang , Bhaskar D. Rao

A methodology is developed to realized optimal channel input conditional distributions, which maximize the finite-time horizon directed information, for channels with memory and feedback, by information lossless randomized strategies. The…

Information Theory · Computer Science 2016-04-06 Charalambos D. Charalambous , Christos K. Kourtellaris , Sergey Loyka

A symmetric butterfly network (BFN) with a full-duplex relay operating in a bi-directional fashion for feedback is considered. This network is relevant for a variety of wireless networks, including cellular systems dealing with cell-edge…

Information Theory · Computer Science 2012-07-30 Anas Chaaban , Aydin Sezgin , Daniela Tuninetti

The property of the optimal signal ensembles of entanglement assisted channel capacity is studied. A relationship between entanglement assisted channel capacity and one-shot capacity of unassisted channel is obtained. The data processing…

Quantum Physics · Physics 2009-11-10 Heng Fan

We study parallel symmetric 2-user interference channels when the interference is bursty and feedback is available from the respective receivers. Presence of interference in each subcarrier is modeled as a memoryless Bernoulli random state.…

Information Theory · Computer Science 2014-04-25 Shaunak Mishra , I-Hsiang Wang , Suhas Diggavi

A formula is derived for the capacity of the Gaussian channel with a benevolent message-cognizant rate-limited helper that provides a noncausal description of the noise to the encoder and decoder. This capacity is strictly larger than when…

Information Theory · Computer Science 2023-10-25 Amos Lapidoth , Ligong Wang , Yiming Yan

This paper derives outer bounds on the secrecy capacity region of the 2-user Z interference channel (Z-IC) with rate-limited unidirectional cooperation between the transmitters. First, the model is studied under the linear deterministic…

Information Theory · Computer Science 2016-04-12 Parthajit Mohapatra , Chandra R. Murthy , Jemin Lee

The symmetric K user interference channel with fully connected topology is considered, in which (a) each receiver suffers interference from all other (K-1) transmitters, and (b) each transmitter has causal and noiseless feedback from its…

Information Theory · Computer Science 2012-12-24 Soheil Mohajer , Ravi Tandon , H. Vincent Poor

This paper studies the interference channel with two transmitters and two receivers in the presence of a MIMO relay in the low transmit power regime. A communication scheme combining block Markov encoding, beamforming, and Willems' backward…

Information Theory · Computer Science 2009-10-21 Anas Chaaban , Aydin Sezgin

We present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have…

Quantum Physics · Physics 2008-08-28 Graeme Smith , John A. Smolin , Andreas Winter

In this letter, we derive the impulse response of the channel with a spherical absorbing receiver, a spherical reflecting boundary, and a point transmitter in molecular communication domain. By exploring the channel characteristics and…

Emerging Technologies · Computer Science 2019-12-11 Fatih Dinc , Bayram Cevdet Akdeniz , Ali Emre Pusane , Tuna Tugcu

The capacity region of multi-pair bidirectional relay networks, in which a relay node facilitates the communication between multiple pairs of users, is studied. This problem is first examined in the context of the linear shift deterministic…

Information Theory · Computer Science 2016-11-17 Aydin Sezgin , A. Salman Avestimehr , M. Amin Khajehnejad , Babak Hassibi

We study the capacity region of two-user erasure interference channels with local delayed channel state information at the transmitters. In our model, transmitters have local mismatched outdated knowledge of the channel gains. We propose a…

Information Theory · Computer Science 2016-07-26 Alireza Vahid , Robert Calderbank
‹ Prev 1 8 9 10 Next ›