Elements of information theory
Elements of information theory
The multicast capacity of deterministic relay networks with no interference
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Towards an information theory of large networks: an achievable rate region
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
An achievable rate for the multiple-level relay channel
IEEE Transactions on Information Theory
Capacity of a class of relay channels with orthogonal components
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Parity forwarding for multiple-relay networks
IEEE Transactions on Information Theory
Simultaneous partial and backward decoding approach for two-level relay networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Multiple relay channels with delays: with and without side information
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Bayesian symbol detection in wireless relay networks via likelihood-free inference
IEEE Transactions on Signal Processing
Hi-index | 0.06 |
A new achievable rate based on a partial decoding scheme is proposed for the multilevel relay network. A novel application of regular encoding and backward decoding is presented to implement the proposed rate. In our scheme, the relays are arranged in feed-forward structure from the source to the destination. Each relay in the network decodes only part of the transmitted message by the previous relay. The proposed scheme differs from general parity forwarding scheme in which each relay selects some relays in the network but decodes all messages of the selected relays. It is also shown that in some cases higher rates can be achieved by the proposed scheme than previously known by Xie and Kumar. For the classes of semideterministic and orthogonal relay networks, the proposed achievable rate is shown to be the exact capacity. The application of the defined networks is very well understood in wireless networking scenarios.