The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Compute-and-Forward: Harnessing Interference Through Structured Codes
Open accessAbstract
Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The key idea is that relays should decode linear functions of transmitted messages according to their observed channel coefficients rather than ignoring the interference as noise. After decoding these linear equations, the relays simply send them towards the destinations, which given enough equations, can recover their desired messages. The underlying codes are based on nested lattices whose algebraic structure ensures that integer combinations of codewords can be decoded reliably. Encoders map messages from a finite field to a lattice and decoders recover equations of lattice points which are then mapped back to equations over the finite field. This scheme is applicable even if the transmitters lack channel state information.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior
Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838089 · Cited by 12,193
Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850663 · Cited by 7,814
Capacity theorems for the relay channel
Cover, T., & Gamal, A. E. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056084 · Cited by 4,123
Li, S.-Y. R., Yeung, R. W., & Cai, N. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.807285 · Cited by 3,378
Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel
Cadambe, V. R., & Jafar, S. A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926344 · Cited by 2,970
A Random Linear Network Coding Approach to Multicast
Ho, T., Medard, M., Koetter, R., Karger, D. R., Effros, M., Shi, J., & Leong, B. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881746 · Cited by 2,553
An algebraic approach to network coding
Koetter, R., & Medard, M. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818197 · Cited by 2,356
A new achievable rate region for the interference channel
Han, T., & Kobayashi, K. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056307 · Cited by 1,588
Hot topic: physical-layer network coding
Zhang, S., Liew, S. C., & Lam, P. P. (2006) · Proceedings of the 12th annual international conference on Mobile computing and networking · doi:10.1145/1161089.1161129 · Cited by 1,512
Cited by
Federated Learning in Mobile Edge Networks: A Comprehensive Survey
Lim, W. Y. B., Luong, N. C., Hoang, D. T., Jiao, Y., Liang, Y.-C., Yang, Q., Niyato, D., & Miao, C. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2986024 · Cited by 2,565
Towards Massive Connectivity Support for Scalable mMTC Communications in 5G Networks
Bockelmann, C., Pratas, N. K., Wunder, G., Saur, S., Navarro, M., Gregoratti, D., Vivier, G., De Carvalho, E., Ji, Y., Stefanovic, C., et al. (2018) · IEEE Access · doi:10.1109/access.2018.2837382 · Cited by 289
“This property led to the so-called compute-and-forward [39], [40], which proved achievable gains, from an information-theory point of view.”
BackgroundMIMO Over-the-Air Computation for High-Mobility Multimodal Sensing
Zhu, G., & Huang, K. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2871070 · Cited by 273
Over-the-Air Computation for IoT Networks: Computing Multiple Functions With Antenna Arrays
Chen, L., Zhao, N., Chen, Y., Yu, F. R., & Wei, G. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2843321 · Cited by 136
Hybrid Beamforming for Massive MIMO Over-the-Air Computation
Zhai, X., Chen, X., Xu, J., & Kwan Ng, D. W. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3051397 · Cited by 74
Metadata
- Authors
- Nazer, B., & Gastpar, M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2011-10
- Volume
- 57
- Issue
- 10
- Pages
- 6463-6486
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2005196269
- Cited by
- 990
- References
- 50
- FWCI
- 149.76
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Compute-and-Forward: Harnessing Interference Through Structured Codes. https://app.cochat.ai/papers/10.1109/tit.2011.2165816
- The paper
- Nazer, B., & Gastpar, M. (2011). Compute-and-Forward: Harnessing Interference Through Structured Codes. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2011.2165816
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
