English
Related papers

Related papers: On the achievable region for interference networks…

200 papers

The paper presents bounds on the achievable rates and the decoding complexity of low-density parity-check (LDPC) codes. It is assumed that the communication of these codes takes place over statistically independent parallel channels where…

Information Theory · Computer Science 2007-07-13 Igal Sason , Gil Wiechman

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

This paper studies a wireless network consisting of multiple transmitter-receiver pairs where interference is treated as noise. Previously, the throughput region of such networks was characterized for either one time slot or an infinite…

Information Theory · Computer Science 2016-11-08 Yirui Cong , Xiangyun Zhou , Rodney A. Kennedy

The capacity of wireless networks is a classic and important topic of study. Informally, the capacity of a network is simply the total amount of information which it can transfer. In the context of models of wireless radio networks, this…

Computer Science and Game Theory · Computer Science 2019-09-16 Michael Dinitz , Naomi Ephraim

Recent results establish the optimality of interference alignment to approach the Shannon capacity of interference networks at high SNR. However, the extent to which interference can be aligned over a finite number of signalling dimensions…

Information Theory · Computer Science 2016-11-17 Krishna Gomadam , Viveck R. Cadambe , Syed A. Jafar

We study a problem of scheduling real-time traffic with hard delay constraints in an unreliable wireless channel. Packets arrive at a constant rate to the network and have to be delivered within a fixed number of slots in a fading wireless…

Networking and Internet Architecture · Computer Science 2013-12-19 Easwar Vivek Mangipudi , Venkatesh Ramaiyan

The cognitive interference channel is an interference channel in which one transmitter is non-causally provided with the message of the other transmitter. This channel model has been extensively studied in the past years and capacity…

Information Theory · Computer Science 2010-03-24 Stefano Rini , Daniela Tuninetti , Natasha Devroye

Recently, Etkin, Tse, and Wang found the capacity region of the two-user Gaussian interference channel to within one bit/s/Hz. A natural goal is to apply this approach to the Gaussian interference channel with an arbitrary number of users.…

Information Theory · Computer Science 2016-11-17 Guy Bresler , Abhay Parekh , David Tse

This paper presents an unusual view of interference wireless networks based on complex system thinking. To proceed with this analysis, a literature review of the different applications of complex systems is firstly presented to illustrate…

Information Theory · Computer Science 2013-03-13 Pedro H. J. Nardelli , Paulo Cardieri , William A. Kretzschmar , Matti Latva-aho

An achievable rate region is obtained for a primary multiple access network coexisting with a secondary link of one transmitter and a corresponding receiver. The rate region depicts the sum primary rate versus the secondary rate and is…

Information Theory · Computer Science 2015-03-18 John Tadrous , Mohammed Nafie

This paper characterizes the trade-offs between information and energy transmission over an additive white Gaussian noise channel in the finite block-length regime with finite sets of channel input symbols. These trade-offs are…

Information Theory · Computer Science 2023-05-25 Sadaf Ul Zuhra , Samir M. Perlaza , H. Vincent Poor , Mikael Skoglund

The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such that observing links in any permissible wiretap set reveals no information about the message. This paper…

Information Theory · Computer Science 2016-11-17 Tao Cui , Tracey Ho , Joerg Kliewer

Opportunistically sharing the white spaces, or the temporarily unoccupied spectrum licensed to the primary user (PU), is a practical way to improve the spectrum utilization. In this paper, we consider the fundamental problem of rate regions…

Information Theory · Computer Science 2015-03-20 Huazi Zhang , Huaiyu Dai , Zhaoyang Zhang

How to aggregate information from multiple instances is a key question multiple instance learning. Prior neural models implement different variants of the well-known encoder-decoder strategy according to which all input features are encoded…

Machine Learning · Computer Science 2022-07-26 Markus Zopf

We investigate the achievable rate of data transmission from sources to sinks through a multiple-relay network. We study achievable rates for omniscient coding, in which all nodes are considered in the coding design at each node. We find…

Information Theory · Computer Science 2010-04-15 Lawrence Ong , Mehul Motani

This paper investigates the achievability of the interference channel coding. It is clarified that the rate-splitting technique is unnecessary to achieve Han-Kobayashi and Jian-Xin-Garg inner regions. Codes are constructed by using sparse…

Information Theory · Computer Science 2022-08-26 Jun Muramatsu

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

In recent years, network coding has become one of the most interesting fields and has attracted considerable attention from both industry and academia. The idea of network coding is based on the concept of allowing intermediate nodes to…

Networking and Internet Architecture · Computer Science 2018-01-09 Somayeh Kafaie , Yuanzhu Peter Chen , Octavia A. Dobre , Mohamed Hossam Ahmed

We analyze the achievable rate in interference-free wireless networks with physical layer fading channels and orthogonal multiple access. As a starting point, the point-to-point channel is considered. We find the optimal physical and…

Information Theory · Computer Science 2016-11-18 Tao Cui , Tracey Ho , Joerg Kliewer

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