An algebraic and probabilistic framework for network information theory
SS Pradhan, A Padakandla… - Foundations and Trends …, 2020 - nowpublishers.com
In this monograph, we develop a mathematical framework based on asymptotically good
random structured codes, ie, codes possessing algebraic properties, for network information …
random structured codes, ie, codes possessing algebraic properties, for network information …
A partial compress-and-forward strategy for relay-assisted wireless networks based on rateless coding
W Ding, M Shikh-Bahaei - IEEE Transactions on Vehicular …, 2023 - ieeexplore.ieee.org
In this work, we propose a novel partial compress-and-forward (PCF) scheme for improving
the maximum achievable transmission rate of a diamond relay network with two noisy relays …
the maximum achievable transmission rate of a diamond relay network with two noisy relays …
On the capacity of the half-duplex diamond channel
H Bagheri, AS Motahari… - 2010 IEEE International …, 2010 - ieeexplore.ieee.org
In this paper, a dual-hop communication system composed of a source S and a destination
D connected through two non-interfering half-duplex relays, R 1 and R 2, is considered. In …
D connected through two non-interfering half-duplex relays, R 1 and R 2, is considered. In …
On codebook information for interference relay channels with out-of-band relaying
A standard assumption in network information theory is that all nodes are informed at all
times of the operations carried out (eg, of the codebooks used) by any other terminal in the …
times of the operations carried out (eg, of the codebooks used) by any other terminal in the …
On the optimal delay growth rate of multi-hop line networks: Asymptotically delay-optimal designs and the corresponding error exponents
Multi-hop line networks have emerged as an important abstract model for modern and
increasingly dense communication networks. In addition, the growth of real-time and mission …
increasingly dense communication networks. In addition, the growth of real-time and mission …
The approximate capacity of the Gaussian N-relay diamond network
U Niesen, SN Diggavi - IEEE Transactions on Information …, 2012 - ieeexplore.ieee.org
We consider the Gaussian “diamond” or parallel relay network, in which a source node
transmits a message to a destination node with the help of N relays. Even for the symmetric …
transmits a message to a destination node with the help of N relays. Even for the symmetric …
When is compress-and-forward optimal?
In many known examples where compress-and-forward (CF) for relay networks is capacity
achieving, it is only trivially so, ie, it falls back to hashing without quantization. A potentially …
achieving, it is only trivially so, ie, it falls back to hashing without quantization. A potentially …
Generalized compression strategy for the downlink cloud radio access network
This paper studies the downlink of a cloud radio access network (C-RAN) in which a
centralized processor (CP) communicates with mobile users through base stations (BSs) …
centralized processor (CP) communicates with mobile users through base stations (BSs) …
The Gaussian multiple access diamond channel
In this paper, we study the capacity of the diamond channel. We focus on the special case
where the channel between the source node and the two relay nodes are two separate links …
where the channel between the source node and the two relay nodes are two separate links …
Capacity bounds for diamond networks with an orthogonal broadcast channel
SS Bidokhti, G Kramer - IEEE Transactions on Information …, 2016 - ieeexplore.ieee.org
A class of diamond networks is studied where the broadcast component is orthogonal and
modeled by two independent bit-pipes. New upper and lower bounds on the capacity are …
modeled by two independent bit-pipes. New upper and lower bounds on the capacity are …