Capacity of a Class of Linear Binary Field Multisource Relay Networks
- 14 June 2013
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (10) , 6405-6420
Abstract
In this paper, we study a layered linear binary field network with time-varying channels, which is a simplified model reflecting broadcast, interference, and fading natures of wireless communications. We observe that fading can play an important role in mitigating interuser interference effectively for both single-hop and multihop networks. We propose new coding schemes with randomized ergodic channel pairing, which exploit such channel variations, and derive their achievable ergodic rates. By comparing them with the cut-set upper bound, the capacity region of single-hop networks and the sum capacity of multihop networks are characterized for some classes of channel distributions and network topologies.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Wireless Network Information Flow: A Deterministic ApproachIEEE Transactions on Information Theory, 2011
- Capacity of the Gaussian Two-Way Relay Channel to Within ${1\over 2}$ BitIEEE Transactions on Information Theory, 2010
- The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference ChannelsIEEE Transactions on Information Theory, 2010
- Gaussian Interference Channel Capacity to Within One BitIEEE Transactions on Information Theory, 2008
- Approximate capacity of the two-way relay channel: A deterministic approach2008
- Transmission techniques for relay-interference networks2008
- The two‐user Gaussian interference channel: a deterministic viewEuropean Transactions on Telecommunications, 2008
- Unicast Transmission Over Multiple Access Erasure Networks: Capacity and Duality2007
- On Network Coding for Interference Networks2006
- Random coding in noise-free multiple access networks over finite fields2004