The DOI matches its Crossref record; 74 of the 74 references it cites were found in a registry or an index.
Reliable Physical Layer Network Coding
Open accessAbstract
When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted interference. This property of the wireless medium is typically viewed as a hindrance to reliable communication over a network. However, using a recently developed coding strategy, interference can in fact be harnessed for network coding. In a wired network, (linear) network coding refers to each intermediate node taking its received packets, computing a linear combination over a finite field, and forwarding the outcome towards the destinations. Then, given an appropriate set of linear combinations, a destination can solve for its desired packets. For certain topologies, this strategy can attain significantly higher throughputs over routing-based strategies. Reliable physical layer network coding takes this idea one step further: using judiciously chosen linear error-correcting codes, intermediate nodes in a wireless network can directly recover linear combinations of the packets from the observed noisy superpositions of transmitted signals. Starting with some simple examples, this paper explores the core ideas behind this new technique and the possibilities it offers for communication over interference-limited wireless networks.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
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
Goldsmith, A. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511841224 · Cited by 10,658
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
(2006) · Choice Reviews Online · doi:10.5860/choice.43-4686 · Cited by 8,128
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
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
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
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
Maximal Flow Through a Network
Ford, L. R., & Fulkerson, D. R. (1956) · Canadian Journal of Mathematics · doi:10.4153/cjm-1956-045-5 · Cited by 2,410
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
XORs in the Air: Practical Wireless Network Coding
Katti, S., Rahul, H., Hu, W., Katabi, D., Medard, M., & Crowcroft, J. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.923722 · Cited by 2,252
Maximal Flow Through a Network
Ford, L. R., & Fulkerson, D. R. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_15 · Cited by 1,829
Cover, T. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054727 · Cited by 1,670
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
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Embracing wireless interference: analog network coding
Katti, S., Gollakota, S., & Katabi, D. (2007) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1282380.1282425 · Cited by 1,253
Information Theory and Reliable Communication
Gallager, R. (1972) · Springer eBooks · doi:10.1007/978-3-7091-2945-6 · Cited by 1,204
Coding for Errors and Erasures in Random Network Coding
Koetter, R., & Kschischang, F. R. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926449 · Cited by 1,053
Compute-and-Forward: Harnessing Interference Through Structured Codes
Nazer, B., & Gastpar, M. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165816 · Cited by 990
Self-citationPolynomial Time Algorithms for Multicast Network Code Construction
Jaggi, S., Sanders, P., Chou, P. A., Effros, M., Egner, S., Jain, K., & Tolhuizen, L. M. G. M. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.847712 · Cited by 940
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
Information Theory and Network Coding
Yeung, R. W., Wolf, J. K., & Gallager, R. G. (2008) · Springer eBooks · doi:10.1007/978-0-387-79234-7 · Cited by 708
Multi-way communication channels
Ahlswede, R. (1973) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 615
Optimal beamforming for two-way multi-antenna relay channel with analogue network coding
Zhang, R., Liang, Y.-C., Chai, C. C., & Cui, S. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090611 · Cited by 560
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
Optimized constellations for two-way wireless relaying with physical network coding
Koike-Akino, T., Popovski, P., & Tarokh, V. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090617 · Cited by 475
On the capacity of wireless networks: the relay case
Gastpar, M., & Vetterli, M. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019409 · Cited by 467
Self-citationA note on the maximum flow through a network
Elias, P., Feinstein, A., & Shannon, C. (1956) · IEEE Transactions on Information Theory · doi:10.1109/tit.1956.1056816 · Cited by 456
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
Performance Bounds for Bidirectional Coded Cooperation Protocols
Kim, S. J., Mitran, P., & Tarokh, V. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929913 · Cited by 446
A simple converse for broadcast channels with additive white Gaussian noise (Corresp.)
Bergmans, P. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055184 · Cited by 445
Channel coding: The road to channel capacity
Costello, D. J., & Forney, G. D. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.895188 · Cited by 408
Liao, H. H.-J. (1972) · Cited by 391
Capacity of wireless erasure networks
Dana, A. F., Gowaikar, R., Palanki, R., Hassibi, B., & Effros, M. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864424 · Cited by 389
Yeung, R. W., Li, S.-Y. R., Cai, N., & Zhang, Z. (2006) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000007 · Cited by 381
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
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
Channel coding and decoding in a relay system operated with physical-layer network coding
Zhang, S. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090618 · Cited by 319
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
A close-to-capacity dirty paper coding scheme
Erez, U., & ten Brink, S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855586 · Cited by 307
Joung, J., & Sayed, A. H. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2038668 · Cited by 292
Fragouli, C., & Soljanin, E. (2006) · now publishers, Inc. eBooks · doi:10.1561/9781601980335 · Cited by 288
Fragouli, C., & Soljanin, E. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000003 · Cited by 216
Slepian-Wolf coding over broadcast channels
Tuncel, E. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871609 · Cited by 184
Fragouli, C., & Soljanin, E. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601980458 · Cited by 171
On the Capacity and Diversity-Multiplexing Tradeoff of the Two-Way Relay Channel
Vaze, R., & Heath, R. W. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2146710 · Cited by 149
Zamir, R. (2009) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2009.5044976 · Cited by 133
Lattice codes can achieve capacity on the AWGN channel
Urbanke, R. L., & Rimoldi, B. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651040 · 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
The multicast capacity of deterministic relay networks with no interference
Ratnakar, N., & Kramer, G. G. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874431 · Cited by 99
Capacity of the two‐way relay channel within a constant gap
Avestimehr, A. S., Sezgin, A., & Tse, D. N. C. (2010) · European Transactions on Telecommunications · doi:10.1002/ett.1399 · Cited by 88
Linear network codes: A unified framework for source, channel, and network coding
Effros, M., Médard, M., Ho, T., Ray, S., Karger, D. R., Koetter, R., & Hassibi, B. (2004) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/066/13 · Cited by 87
Optimized multipath network coding in lossy wireless networks
Zhang, X., & Li, B. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090605 · Cited by 78
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-citationProviding 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
On the design of practical asynchronous physical layer network coding
Rossetto, F., & Zorzi, M. (2009) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc.2009.5161829 · Cited by 65
On capacity of random wireless networks with physical-layer network coding
Lu, K., Fu, S., Qian, Y., & Chen, H. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090616 · Cited by 65
Zhan, J., Nazer, B., Gastpar, M., & Erez, U. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205264 · Cited by 55
Self-citationChannel Coding Design to Support Asynchronous Physical Layer Network Coding
Wang, D., Fu, S., & Lu, K. (2009) · Globecom · doi:10.1109/glocom.2009.5425968 · Cited by 37
A Generalized Two-Way Relay Channel with Private Information for the Relay
Ho, C. K., Gowda, K. T., & Sun, S. (2009) · International Conference on Communications · doi:10.1109/icc.2009.5198611 · Cited by 12
Line and Lattice Networks Under Deterministic Interference Models
Goseling, J., Gastpar, M., & Weber, J. H. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2119550 · Cited by 8
Self-citationPerformance Analysis of Physical Layer Network Coding.
Kim, J. (2009) · Deep Blue (University of Michigan) · Cited by 6
Exploiting Interference through Algebraic Structure
Nazer, B. (2009) · eScholarship (California Digital Library) · Cited by 2
Self-citation
Cited by
Compute-and-Forward: Harnessing Interference Through Structured Codes
Nazer, B., & Gastpar, M. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165816 · Cited by 990
Self-citationPhysical-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
“The presented Slotted Compute-and-Forward (SCF) approach is a random access extension of the Compute-and-Forward (CF) relaying scheme introduced in [49].”
MethodMIMO 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
Metadata
- Authors
- Nazer, B., & Gastpar, M.
- Venue
- Proceedings of the IEEE
- Published
- 2011-03
- Volume
- 99
- Issue
- 3
- Pages
- 438-460
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W2048540241
- Cited by
- 276
- References
- 74
- FWCI
- 60.33
- 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.