The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Network Coding Theory
Abstract
Store-and-forward had been the predominant technique for transmitting information through a network until its optimality was refuted by network coding theory. Network coding offers a new paradigm for network communications and has generated abundant research interest in information and coding theory, networking, switching, wireless communications, cryptography, computer science, operations research, and matrix theory. We review the foundational work that has led to the development of network coding theory and discuss the theory for the transmission from a single source node to other nodes in the network. A companion issue discusses the theory when there are multiple source nodes each intending to transmit to a different set of destination nodes.
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
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. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
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
Self-citationCombinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Directed diffusion: a scalable and robust communication paradigm for sensor networks
Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345920 · Cited by 5,393
Error control coding : fundamentals and applications
Lin, S., & Costello, D. J. (1983) · Medical Entomology and Zoology · Cited by 4,296
Polynomial Codes Over Certain Finite Fields
Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,662
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-citationAn 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
Theory and practice of error control codes
Blahut, R. E. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 2,066
Error Control Systems for Digital Communication and Storage
Wicker, S. B. (1995) · Medical Entomology and Zoology · Cited by 1,775
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
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
A First Course in Abstract Algebra.
Bogart, K. P., Gratzer, G., & Fraleigh, J. B. (1969) · The American Mathematical Monthly · doi:10.2307/2317912 · Cited by 711
On coding for reliable communication over packet networks
Lun, D. S., Médard, M., Koetter, R., & Effros, M. (2008) · Physical Communication · doi:10.1016/j.phycom.2008.01.006 · Cited by 559
Berger, T. (1978) · Medical Entomology and Zoology · Cited by 552
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-citationSingleton, R. (1964) · IEEE Transactions on Information Theory · doi:10.1109/tit.1964.1053661 · Cited by 533
Cai, N., & Yeung, R. W. (2003) · Proceedings IEEE International Symposium on Information Theory, · doi:10.1109/isit.2002.1023595 · Cited by 444
Self-citationOn characterization of entropy function via information inequalities
Zhang, Z., & Yeung, R. W. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.681320 · Cited by 351
Self-citationNetwork 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-citationPolynomial 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
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
A framework for linear information inequalities
Yeung, R. W. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.641556 · Cited by 184
Self-citationNetwork coding and error correction
Cai, N., & Yeung, R. W. (2003) · Proceedings of the IEEE Information Theory Workshop · doi:10.1109/itw.2002.1115432 · Cited by 179
Self-citationDimakis, A. G., Prabhakaran, V. M., & Ramchandran, K. (2005) · doi:10.5555/1147685.1147708 · Cited by 164
Network information flow with correlated sources
Barros, J., & Servetto, S. D. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860435 · Cited by 150
Multilevel diversity coding with distortion
Yeung, R. W. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.370142 · Cited by 141
Self-citationRepresentation of matroidsPreprint
Lunelli, M., & Laface, A. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0202294 · Cited by 125
On the advantage of network coding for improving network throughput
Agarwal, A., & Charikar, M. (2005) · Manufacturing Engineer · doi:10.1109/itw.2004.1405308 · Cited by 122
Symmetrical 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-citationSeparating distributed source coding from network coding
Ramamoorthy, A., Jain, K. K., Chou, P. A., & Effros, M. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874534 · Cited by 94
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
Network coding from a network flow perspective
Ho, T., Karger, D. R., Médard, M., & Koetter, R. (2003) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2003.1228458 · Cited by 74
A separation theorem for single-source network coding
Song, L., Yeung, R. W., & Cai, N. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.872983 · Cited by 59
Self-citationMatrix games in the multicast networks: maximum information flows with network switching
Liang, X.-B. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874517 · Cited by 36
Reversible and Irreversible Information Networks
Riis, S. K. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.907345 · Cited by 31
Efficient Multipath in Sensor Networks using Diffusion and Network Coding
Toledo, A. L., & Wang, X. (2006) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2006.286441 · Cited by 29
Network information flow theory
Ahlswede, R., Cai, N., & Yeung, R. W. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.1998.708784 · Cited by 18
Self-citation
Metadata
- Authors
- Yeung, R. W., Li, S.-Y. R., Cai, N., & Zhang, Z.
- Venue
- Foundations and Trends® in Communications and Information Theory
- Publisher
- Now Publishers Inc
- Published
- 2006
- Volume
- 2
- Issue
- 4
- Pages
- 241-329
- ISSN
- 1567-2190 (ISSN-L)
- OpenAlex
- W646142101
- Cited by
- 381
- References
- 39
- FWCI
- 50.85
- 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.
