English
Related papers

Related papers: The Deterministic Multicast Capacity of 4-Node Rel…

200 papers

We present capacity results of the binary-symmetric parallel-relay network, where there is one source, one destination, and K relays in parallel. We show that forwarding relays, where the relays merely transmit their received signals,…

Information Theory · Computer Science 2015-03-14 Lawrence Ong , Sarah J. Johnson , Christopher M. Kellett

Full-duplex multi-way relaying is a potential solution for supporting high data rates in future Internet-of-Things (IoT) and 5G networks. Thus, in this paper the full-duplex MIMO multi-way channel consisting of 3 users (Y-channel) with $M$…

Information Theory · Computer Science 2014-12-03 Anas Chaaban , Aydin Sezgin

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, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews

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

We derive bounds on the noncoherent capacity of a very general class of multiple-input multiple-output channels that allow for selectivity in time and frequency as well as for spatial correlation. The bounds apply to peak-constrained…

Information Theory · Computer Science 2008-01-29 Ulrich G. Schuster , Giuseppe Durisi , Helmut Bölcskei , H. Vincent Poor

We consider a source-destination pair assisted by parallel regenerative decode-and-forward relays operating in orthogonal channels. We investigate distributed power allocation strategies for this system with limited channel state…

Information Theory · Computer Science 2008-01-07 Min Chen , Semih Serbetli , Aylin Yener

We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model this problem via an adversarial noise, presenting a formal…

Information Theory · Computer Science 2022-05-31 Allison Beemer , Altan Berdan Kilic , Alberto Ravagnani

A network where three users want to establish multiple unicasts between each other via a relay is considered. This network is called the Y-channel and resembles an elemental ingredient of future wireless networks. The sum-capacity of this…

Information Theory · Computer Science 2016-11-17 Anas Chaaban , Aydin Sezgin , A. Salman Avestimehr

Designing an efficient routing strategy is of great importance to alleviate traffic congestion in multilayer networks. In this work, we design an effective routing strategy for multilayer networks by comprehensively considering the roles of…

Physics and Society · Physics 2019-07-31 Lei Gao , Panpan Shu , Ming Tang , Wei Wang , Hui Gao

In this paper, we study the capacity of the two-user multiple-input multiple-output (MIMO) linear deterministic interference channel (IC), with possible correlations within/between the channel matrices. The capacity region is characterized…

Information Theory · Computer Science 2012-07-10 Xiaoli Xu , Yong Zeng , Yong Liang Guan , Tracey Ho

In this paper, two-hop communication between a source and a destination with the aid of an intermediate relay node is considered. Both the source and intermediate relay node are assumed to operate under statistical quality of service (QoS)…

Information Theory · Computer Science 2010-10-01 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

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 provide a geometric solution to the problem of optimal relay positioning to maximize the multicast rate for low-SNR networks. The networks we consider, consist of a single source, multiple receivers and the only intermediate and…

Information Theory · Computer Science 2011-06-02 Mohit Thakur , Nadia Fawaz , Muriel Médard

In this paper we study a Gaussian relay-interference network, in which relay (helper) nodes are to facilitate competing information flows over a wireless network. We focus on a two-stage relay-interference network where there are weak…

Information Theory · Computer Science 2010-05-05 Soheil Mohajer , Suhas N. Diggavi , Christina Fragouli , David N. C. Tse

In this work we improve on the bounds presented by Li&Li for network coding gain in the undirected case. A tightened bound for the undirected multicast problem with three terminals is derived. An interesting result shows that with…

Information Theory · Computer Science 2016-11-18 Ali Al-Bashabsheh , Abbas Yongacoglu

This paper studies the noncausal relay channel, also known as the relay channel with unlimited lookahead, introduced by El Gamal, Hassanpour, and Mammen. Unlike the standard relay channel model, where the relay encodes its signal based on…

Information Theory · Computer Science 2017-04-20 Lele Wang , Mohammad Naghshvar

In a multi-user wireless network equipped with multiple relay nodes, some relays are more intelligent than other relay nodes. The intelligent relays are able to gather channel state information, perform linear processing and forward signals…

Information Theory · Computer Science 2015-06-04 Zuleita Ho , Eduard Jorswieck

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

The capacity or approximations to capacity of various single-source single-destination relay network models has been characterized in terms of the cut-set upper bound. In principle, a direct computation of this bound requires evaluating the…

Information Theory · Computer Science 2011-11-21 Farzad Parvaresh , Raul Etkin