The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Network information flow
Abstract
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be multicast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. This model subsumes all previously studied models along the same line. We study the problem with one information source, and we have obtained a simple characterization of the admissible coding rate region. Our result can be regarded as the max-flow min-cut theorem for network information flow. Contrary to one's intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated. Rather, by employing coding at the nodes, which we refer to as network coding, bandwidth can in general be saved. This finding may have significant impact on future design of switching systems.
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. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 1×
“Recently, there has been a lot of interest in factor graph [7], a graphical model which subsumes Markov random field, Bayesian network, and Tanner graph.”
BackgroundNoiseless coding of correlated information sources
Slepian, D., & Wolf, J. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055037 · Cited by 3,952
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
Self-citationBollobás, B. (1979) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-9967-7 · Cited by 610
Singleton, R. (1964) · IEEE Transactions on Information Theory · doi:10.1109/tit.1964.1053661 · Cited by 533
Codes and iterative decoding on general graphs
Wiberg, N., Loeliger, H., & Kotter, R. (1995) · European Transactions on Telecommunications · doi:10.1002/ett.4460060507 · Cited by 314
Multilevel diversity coding with distortion
Yeung, R. W. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.370142 · Cited by 141
Self-citationSymmetrical multilevel diversity coding
Roche, J. R., Yeung, R. W., & Hau, K. P. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.568720 · Cited by 108
Self-citation
Cited by
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
Self-citationWireless Networks With RF Energy Harvesting: A Contemporary Survey
Lu, X., Wang, P., Niyato, D., Kim, D. I., & Han, Z. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2368999 · Cited by 2,603
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
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
Network Coding for Distributed Storage Systems
Dimakis, A. G., Godfrey, P. B., Wu, Y., Wainwright, M. J., & Ramchandran, K. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054295 · Cited by 1,914
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726
“The caching problem introduced in this paper is related to the index coding problem [8], [9] (or, equivalently [11], the network coding problem [12]).”
BackgroundHot 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
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Spatial Modulation for Generalized MIMO: Challenges, Opportunities, and Implementation
Di Renzo, M., Haas, H., Ghrayeb, A., Sugiura, S., & Hanzo, L. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2013.2287851 · Cited by 1,446
Space-Air-Ground Integrated Network: A Survey
Liu, J., Shi, Y., Fadlullah, Z. M., & Kato, N. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2841996 · Cited by 1,281
Trading structure for randomness in wireless opportunistic routing
Chachulski, S., Jennings, M., Katti, S., & Katabi, D. (2007) · Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1282380.1282400 · Cited by 1,082
Network coding for large scale content distribution
Gkantsidis, C., & Rodriguez, P. R. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498511 · Cited by 1,051
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
Polynomial 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
Computation Over Multiple-Access Channels
Nazer, B., & Gastpar, M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.904785 · Cited by 753
Noor-A-Rahim, M., Liu, Z., Lee, H., Khyam, M. O., He, J., Pesch, D., Moessner, K., Saad, W., & Poor, H. V. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3173031 · Cited by 737
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601982414 · Cited by 686
Recent and Emerging Topics in Wireless Industrial Communications: A Selection
Willig, A. (2008) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2008.923194 · Cited by 656
A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
Jiang, L., & Walrand, J. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2009.2035046 · Cited by 635
Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff
Maddah-Ali, M. A., & Niesen, U. (2015) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2014.2317316 · Cited by 626
A survey of autonomic communications
Dobson, S., Denazis, S., Fernández, A., Gaïti, D., Gelenbe, E., Massacci, F., Nixon, P., Saffre, F., Schmidt, N., & Zambonelli, F. (2006) · ACM Transactions on Autonomous and Adaptive Systems · doi:10.1145/1186778.1186782 · Cited by 626
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2009) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000036 · Cited by 570
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
Information fusion for wireless sensor networks: Methods, models, and classifications
Nakamura, E. F., Loureiro, A. A. F., & Frery, A. C. (2007) · ACM Computing Surveys · doi:10.1145/1267070.1267073 · Cited by 537
A First Course in Information Theory
Yeung, R. W. (2002) · Information Technology: Transmission, Processing and Storage · doi:10.1007/978-1-4419-8608-5 · Cited by 533
Self-citationThe Evolution of Quantum Key Distribution Networks: On the Road to the Qinternet
Cao, Y., Zhao, Y., Wang, Q., Zhang, J., Ng, S. X., & Hanzo, L. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3144219 · Cited by 505
Index Coding With Side Information
Bar-Yossef, Z., Birk, Y., Jayram, T. S., & Kol, T. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2103753 · Cited by 498
XORs in the air: practical wireless network coding
Katti, S., Rahul, H., Hu, W., Katabi, D., Médard, M., & Crowcroft, J. (2006) · Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1159913.1159942 · Cited by 495
Trading structure for randomness in wireless opportunistic routing
Chachulski, S., Jennings, M., Katti, S., & Katabi, D. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1282427.1282400 · Cited by 485
Optimal Estimation in Networked Control Systems Subject to Random Delay and Packet Drop
Schenato, L. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.921012 · Cited by 483
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
A Survey on Technologies, Standards and Open Challenges in Satellite IoT
Centenaro, M., Costa, C. E., Granelli, F., Sacchi, C., & Vangelista, L. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3078433 · Cited by 448
A Fundamental Tradeoff Between Computation and Communication in Distributed Computing
Li, S., Maddah-Ali, M. A., Yu, Q., & Avestimehr, A. S. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2756959 · Cited by 451
Self-citationThe Capacity of Private Information Retrieval
Sun, H., & Jafar, S. A. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2689028 · Cited by 447
Cai, N., & Yeung, R. W. (2003) · Proceedings IEEE International Symposium on Information Theory, · doi:10.1109/isit.2002.1023595 · Cited by 444
Self-citationTowards an information theory of large networks: an achievable rate region
Gupta, P., & Kumar, P. R. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.814480 · Cited by 435
Coded caching with nonuniform demands
Niesen, U., & Maddah-Ali, M. A. (2014) · 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infcomw.2014.6849235 · Cited by 415
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
Wireless Broadcast Using Network Coding
Nguyen, D., Tran, T., Nguyen, T., & Bose, B. (2009) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2008.927729 · 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
Self-citationIdentifying emerging topics in science and technology
Small, H., Boyack, K. W., & Klavans, R. (2014) · Research Policy · doi:10.1016/j.respol.2014.02.005 · Cited by 378
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
Signing a Linear Subspace: Signature Schemes for Network Coding
Boneh, D., Freeman, D., Katz, J., & Waters, B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00468-1_5 · Cited by 351
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
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Ma, Z., Xiao, M., Xiao, Y., Pang, Z., Poor, H. V., & Vucetic, B. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2907245 · Cited by 315
The Capacity of Robust Private Information Retrieval With Colluding Databases
Sun, H., & Jafar, S. A. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2777490 · Cited by 312
Network Error Correction, I: Basic Concepts and Upper Bounds
Cai, N., Cai, N., Yeung, R. W., & Yeung, R. W. (2006) · Communications in Information and Systems · doi:10.4310/cis.2006.v6.n1.a2 · Cited by 312
Self-citationCooperative Security for Network Coding File Distribution
Gkantsidis, C., & Rodriguez Rodriguez, P. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.233 · Cited by 308
On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
El Rouayheb, S., Sprintson, A., & Georghiades, C. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048502 · Cited by 293
A Review of Information Dissemination Protocols for Vehicular Ad Hoc Networks
Panichpapiboon, S., & Pattara-atikom, W. (2011) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.070711.00131 · Cited by 292
Fragouli, C., & Soljanin, E. (2006) · now publishers, Inc. eBooks · doi:10.1561/9781601980335 · Cited by 288
Kramer, G., Marić, I., & Yates, R. D. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · Cited by 282
Wei, L., Hu, R., Qian, Y., & Wu, G. (2014) · IEEE Communications Magazine · doi:10.1109/mcom.2014.6829950 · Cited by 282
Network Coding Meets TCP: Theory and Implementation
Sundararajan, J. K., Shah, D., Médard, M., Jakubczak, S., Mitzenmacher, M., & Barros, J. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2093850 · Cited by 277
Reliable Physical Layer Network Coding
Nazer, B., & Gastpar, M. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2094170 · Cited by 276
Polynomial time algorithms for network information flow
Sanders, P., Egner, S., & Tolhuizen, L. (2003) · Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures · doi:10.1145/777412.777464 · Cited by 269
The challenges of M2M massive access in wireless cellular networks
Biral, A., Centenaro, M., Zanella, A., Vangelista, L., & Zorzi, M. (2015) · Digital Communications and Networks · doi:10.1016/j.dcan.2015.02.001 · Cited by 262
A Survey on Opportunistic Routing in Wireless Communication Networks
Chakchouk, N. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2411335 · Cited by 260
Decentralized erasure codes for distributed networked storage
Dimakis, A. G., Prabhakaran, V., & Ramchandran, K. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874535 · Cited by 253
Network Coding for the Internet and Wireless Networks
Chou, P., & Wu, Y. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.904818 · Cited by 253
Byzantine modification detection in multicast networks using randomized network coding
Ho, T., Leong, B., Koetter, R., Medard, M., Effros, M., & Karger, D. R. (2004) · International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. · doi:10.1109/isit.2004.1365180 · Cited by 253
Hughes, L., Wang, X., & Chen, T. (2012) · Sensors · doi:10.3390/s121114730 · Cited by 71
Hai, D. T. (2019) · Telecommunication Systems · doi:10.1007/s11235-018-0474-9 · Cited by 32
Non-geostationary orbit constellation design for global connectivity
Leyva-Mayorga, I., Soret, B., Matthiesen, B., Röper, M., Wübben, D., Dekorsy, A., & Popovski, P. (2022) · Non-Geostationary Satellite Communications Systems · doi:10.1049/pbte105e_ch10 · Cited by 20
NC-MAC: Network Coding-based Distributed MAC Protocol for Reliable Beacon Broadcasting in V2X
Mosavat-Jahromi, H., Li, Y., Cai, L., & Lu, L. (2020) · GLOBECOM 2020 - 2020 IEEE Global Communications Conference · doi:10.1109/globecom42002.2020.9348080 · Cited by 11
Metadata
- Authors
- Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2000-07
- Volume
- 46
- Issue
- 4
- Pages
- 1204-1216
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2105831729
- Cited by
- 7,814
- References
- 9
- FWCI
- 19.62
- Type
- journal article
- Language
- en
- Open access
- closed
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.