Published July 2012
| public
Book Section - Chapter
Low-Complexity Near-Optimal Codes for Gaussian Relay Networks
Chicago
An error occurred while generating the citation.
Abstract
We consider the problem of information flow over Gaussian relay networks. Similar to the recent work by Avestimehr et al. [1], we propose network codes that achieve up to a constant gap from the capacity of such networks. However, our proposed codes are also computationally tractable. Our main technique is to use the codes of Avestimehr et al. as inner codes in a concatenated coding scheme.
Additional Information
© 2012 IEEE. Date of Current Version: 30 August 2012. This work is partially supported by a grant from the University Grants Committee of the Hong Kong Special Administrative Region, China (Project No. AoE/E-02/08), the CERG grant 412207, and the Project MMT-p7-11 of the Shun Hing Institute of Advanced Engineering, The Chinese University of Hong Kong.Additional details
- Eprint ID
- 33919
- Resolver ID
- CaltechAUTHORS:20120907-074616471
- Hong Kong Special Administrative Region, University Grants Committee
- AoE/E-02/08
- CERG
- 412207
- Shun Hing Institute of Advanced Engineering
- MMT-p7-11
- Chinese University of Hong Kong
- Created
-
2012-09-07Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field