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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Gaussian Interference Channel Capacity to Within One Bit
Etkin, R. H., Tse, D. N. C., & Wang, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2006447 · Cited by 1,370
Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis
Maddah-Ali, M. A., Motahari, A. S., & Khandani, A. K. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926460 · Cited by 1,008
Nested linear/lattice codes for structured multiterminal binning
Zamir, R., Shamai, S., & Erez, U. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003821 · Cited by 876
Wireless Network Information Flow: A Deterministic Approach
Avestimehr, A. S., Diggavi, S. N., & Tse, D. N. C. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2110110 · Cited by 844
Computation Over Multiple-Access Channels
Nazer, B., & Gastpar, M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.904785 · Cited by 753
Self-citationA cautionary perspective on cross-layer design
Kawadia, V., & Kumar, P. R. (2005) · IEEE Wireless Communications · doi:10.1109/mwc.2005.1404568 · Cited by 734
Achieving<tex>$ 1over 2log (1+ hboxSNR)$</tex>on the AWGN Channel With Lattice Encoding and Decoding
Erez, U., & Zamir, R. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834787 · Cited by 732
Joint Physical Layer Coding and Network Coding for Bidirectional Relaying
Wilson, M. P., Narayanan, K., Pfister, H. D., & Sprintson, A. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2068750 · Cited by 494
Lim, S. H., Kim, Y.-H., Gamal, A. E., & Chung, S.-Y. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2119930 · Cited by 449
Zamir, R., & Feder, M. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.508838 · Cited by 375
Lattices Which Are Good for (Almost) Everything
Erez, U., Litsyn, S., & Zamir, R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855591 · Cited by 365
How to encode the modulo-two sum of binary sources (Corresp.)
Korner, J., & Marton, K. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056022 · Cited by 355
Capacity of the Gaussian Two-Way Relay Channel to Within ${1\over 2}$ Bit
Nam, W., Chung, S.-Y., & Lee, Y. H. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2069150 · Cited by 354
Physical-layer network coding: Tutorial, survey, and beyond
Liew, S. C., Zhang, S., & Lu, L. (2013) · Physical Communication · doi:10.1016/j.phycom.2012.05.002 · Cited by 329
The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
Bresler, G., Parekh, A., & Tse, D. N. C. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054590 · Cited by 329
Interference Alignment and the Degrees of Freedom for the K User Interference Channel
Cadambe, V. R., & Jafar, S. A. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.0323 · Cited by 323
Lattice Coding and Decoding Achieve the Optimal Diversity–Multiplexing Tradeoff of MIMO Channels
Gamal, H. E., Caire, G., & Damen, M. O. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828067 · Cited by 309
Reliable Physical Layer Network Coding
Nazer, B., & Gastpar, M. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2094170 · Cited by 276
Self-citationErgodic Interference Alignment
Nazer, B., Gastpar, M., Jafar, S. A., & Vishwanath, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2205217 · Cited by 165
Self-citationCapacity of a Class of Deterministic Relay Channels
Kim, Y.-H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.915921 · Cited by 134
Zamir, R. (2009) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2009.5044976 · Cited by 133
Krithivasan, D., & Pradhan, S. S. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2032853 · Cited by 119
Gamal, A. E., Hassanpour, N., & Mammen, J. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.904838 · Cited by 119
Ergodic interference alignment
Nazer, B., Gastpar, M., Jafar, S. A., & Vishwanath, S. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205270 · Cited by 110
Self-citationEtkin, R., & Ordentlich, E. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2030473 · Cited by 98
Capacity of a Class of Modulo-Sum Relay Channels
Aleksic, M., Razaghi, P., & Yu, W. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2011518 · Cited by 97
On the Loss of Single-Letter Characterization: The Dirty Multiple Access Channel
Philosof, T., & Zamir, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2018174 · Cited by 82
Distributed Source Coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region
Krithivasan, D., & Pradhan, S. S. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2103852 · Cited by 75
The case for structured random codes in network capacity theorems
Nazer, B., & Gastpar, M. (2008) · European Transactions on Telecommunications · doi:10.1002/ett.1284 · Cited by 72
Self-citationRogers, C. A. (1959) · Mathematika · doi:10.1112/s002557930000190x · Cited by 70
Providing Secrecy With Structured Codes: Tools and Applications to Two-User Gaussian ChannelsPreprint
He, X., & Yener, A. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0907.5388 · Cited by 69
Computing over Multiple-Access Channels with Connections to Wireless Network Coding
Nazer, B., & Gastpar, M. (2006) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2006.262047 · Cited by 69
Self-citationNested Lattice Codes for Gaussian Relay Networks With Interference
Nam, W., Chung, S.-Y., & Lee, Y. H. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2170102 · Cited by 67
Joint Wyner–Ziv/Dirty-Paper Coding by Modulo-Lattice Modulation
Kochman, Y., & Zamir, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2030488 · Cited by 59
Integer-forcing linear receivers
Zhan, J., Nazer, B., Erez, U., & Gastpar, M. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513734 · Cited by 51
Self-citationStructured superposition for backhaul constrained cellular uplink
Nazer, B., Sanderovich, A., Gastpar, M., & Shamai, S. S. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205840 · Cited by 51
Self-citationLocal Interference Can Accelerate Gossip Algorithms
Nazer, B., Dimakis, A. G., & Gastpar, M. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2124440 · Cited by 32
Self-citationStructured Random Codes and Sensor Network Coding Theorems
Nazer, B., & Gastpar, M. (2008) · International Zurich Seminar on Communications (IZS) · doi:10.1109/izs.2008.4497288 · Cited by 12
Self-citationCommunicating the Difference of Correlated Gaussian Sources over a MAC
Soundararajan, R., & Vishwanath, S. (2009) · DCC · doi:10.1109/dcc.2009.17 · Cited by 10
Spatial Filtering in Sensor Networks with Computation Codes
Sarwate, A. D., Nazer, B., & Gastpar, M. (2007) · IEEE Statistical Signal Processing Workshop (SSP) · doi:10.1109/ssp.2007.4301336 · Cited by 4
Self-citation
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
Making Cell-Free Massive MIMO Competitive With MMSE Processing and Centralized Implementation
Bjornson, E., & Sanguinetti, L. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2941478 · Cited by 974
Grant-Free Non-Orthogonal Multiple Access for IoT: A Survey
Shahab, M. B., Abbas, R., Shirvanimoghaddam, M., & Johnson, S. J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2996032 · Cited by 453
Physical-layer network coding: Tutorial, survey, and beyond
Liew, S. C., Zhang, S., & Lu, L. (2013) · Physical Communication · doi:10.1016/j.phycom.2012.05.002 · Cited by 329
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.”
Background
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
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.