English
Related papers

Related papers: Optimal Achievable Rates for Interference Networks…

200 papers

The optimal rate of reliable communication over a quantum channel can be enhanced by pre-shared entanglement. Whereas the enhancement may be unbounded in infinite-dimensional settings even when the input power is constrained, a…

A simple encoding scheme based on Sato's non-na\"ive frequency division is proposed for a class of Gaussian interference channels with mixed interference. The achievable region is shown to be equivalent to that of Costa's noiseberg region…

Information Theory · Computer Science 2012-07-16 Yu Zhao , Fangfang Zhu , Biao Chen

This paper investigates the capacity of a wireless two way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-theoretic sense as the maximum information exchange rate…

Information Theory · Computer Science 2008-04-22 Zhang Shengli , Soung Chang Liew

The two-user broadcast channel (BC) with receivers connected by bidirectional cooperation links of finite capacities, known as conferencing decoders, is considered. A novel capacity region outer bound is established based on multiple…

Information Theory · Computer Science 2025-08-12 Reza K. Farsani , Wei Yu

We characterise bounds on the optimal broadcast rate for a few classes of pliable-index-coding instances. Unlike the majority of currently solved instances, which belong to a special class where all receivers with a certain side-information…

Information Theory · Computer Science 2025-12-09 Lawrence Ong , Badri N. Vellambi , Parastoo Sadeghi , Jörg Kliewer

An approach is established for maximizing the Lower bound on the Mismatch capacity (hereafter abbreviated as LM rate), a key performance bound in mismatched decoding, by optimizing the channel input probability distribution. Under a fixed…

Information Theory · Computer Science 2024-05-02 Lingyi Chen , Shitong Wu , Xinwei Li , Huihui Wu , Hao Wu , Wenyi Zhang

The use of existing network devices as relays has a potential to improve the overall network performance. In this work, we consider a two-hop wireless relay setting, where the channels between the source and relay nodes to the destination…

Networking and Internet Architecture · Computer Science 2017-04-11 Mehdi Salehi Heydar Abad , Ozgur Ercetin , Eylem Ekici

We consider the problem of decentralized power allocation for competitive rate-maximization in a frequency-selective Gaussian interference channel under bounded channel uncertainty. We formulate a distribution-free robust framework for the…

Information Theory · Computer Science 2015-03-17 Amod J. G. Anandkumar , Animashree Anandkumar , Sangarapillai Lambotharan , Jonathon A. Chambers

We consider a fundamental problem concerning the deployment of a wireless robotic network: to fulfill various end-to-end performance requirements, a "sufficient" number of robotic relays must be deployed to ensure that links are of…

Robotics · Computer Science 2016-11-28 Pradipta Ghosh , Bhaskar Krishnamachari

The discrete memoryless interference channel is modelled as a conditional probability distribution with two outputs depending on two inputs and has widespread applications in practical communication scenarios. In this paper, we introduce…

Quantum Physics · Physics 2015-03-19 Ivan Savov , Omar Fawzi , Mark M. Wilde , Pranab Sen , Patrick Hayden

The goal of this paper is to obtain a better knowledge of the achievable data rate over noncoherent Rician fading channel with time and frequency memory. We assume that the average-power as well as the peak-power of the input signal are…

Information Theory · Computer Science 2012-07-13 Jean-Michel Passerieux , Francois-Xavier Socheleau , Christophe Laot

A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this setup, and we show that this outer bound is achievable in some cases.…

Information Theory · Computer Science 2010-11-01 Anas Chaaban , Aydin Sezgin

We determine the optimal achievable rate at which entanglement can be reliably transmitted when the memoryless channel used during transmission is unknown both to sender and receiver. To be more precise, we assume that both of them only…

Quantum Physics · Physics 2009-04-21 Igor Bjelakovic , Holger Boche , Janis Noetzel

In this paper, we want to derive achievable secrecy rate regions for quantum interference channel with classical inputs under one-shot setting. The main idea to this end is to use the combination of superposition and rate splitting for…

Information Theory · Computer Science 2023-01-10 Hadi Aghaee , Bahareh Akhbari

We introduce a formal framework to study the multiple unicast problem for a coded network in which the network code is linear over a finite field and fixed. We show that the problem corresponds to an interference alignment problem over a…

Information Theory · Computer Science 2023-09-11 F. R. Kschischang , F. Manganiello , A. Ravagnani , K. Savary

The index coding problem is studied from an interference alignment perspective, providing new results as well as new insights into, and generalizations of, previously known results. An equivalence is established between multiple unicast…

Information Theory · Computer Science 2012-05-08 Hamed Maleki , Viveck R. Cadambe , Syed A. Jafar

The trade-off capacity region of a quantum channel characterizes the optimal net rates at which a sender can communicate classical, quantum, and entangled bits to a receiver by exploiting many independent uses of the channel, along with the…

Quantum Physics · Physics 2015-03-19 Mark M. Wilde , Patrick Hayden , Saikat Guha

We study the throughput-vs-delay trade-off in an overlay multi-channel single-secondary-user cognitive radio system. Due to the limited sensing capabilities of the cognitive radio user, channels are sensed sequentially. Maximizing the…

Information Theory · Computer Science 2016-12-28 Ahmed Ewaisha , Cihan Tepedelenlioglu

This paper proposes a method to optimize communication code rates via the application of neural polar decoders (NPDs). Employing this approach enables simultaneous optimization of code rates over input distributions while providing a…

Information Theory · Computer Science 2025-06-23 Ziv Aharoni , Bashar Huleihel , Henry D Pfister , Haim H Permuter

The problem of maximum rate achievable with analog network coding for a unicast communication over a layered relay network with directed links is considered. A relay node performing analog network coding scales and forwards the signals…

Information Theory · Computer Science 2012-04-24 Samar Agnihotri , Sidharth Jaggi , Minghua Chen