The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Network Coding for the Internet and Wireless Networks
Abstract
In today's practical communication networks such as the Internet, information delivery is performed by routing. A promising generalization of routing is network coding. The potential advantages of network coding over routing include resource (e.g., bandwidth and power) efficiency, computational efficiency, and robustness to network dynamics. This tutorial article provides an overview of the theory, practice, and applications of network coding.
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
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
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
ASH, R. B. (1966) · Cited by 3,990
Noiseless 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
Combinatorial optimization. Polyhedra and efficiency.
Schrijver, A. (2003) · UvA-DARE (University of Amsterdam) · Cited by 3,045
Incentives Build Robustness in Bit-Torrent
Cohen, B. (2003) · Cited by 2,677
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
Measuring ISP topologies with rocketfuel
Spring, N., Mahajan, R., & Wetherall, D. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633039 · Cited by 1,256
Menger, K. (1927) · Fundamenta Mathematicae · doi:10.4064/fm-10-1-96-115 · Cited by 1,216
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
Self-citation(2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-44543-4 · Cited by 917
Compression via channel coding - Distributed source coding for sensor networks
Xiong, Z., Liveris, A. D., & Cheng, S. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1328091 · Cited by 739
A 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
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
Cooperative 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
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
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
Jain, K. K., Mahdian, M., & Salavatipour, M. R. (2003) · doi:10.5555/644108.644154 · Cited by 197
Charles, D. X., Jain, K. K., & Lauter, K. (2006) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2006.286587 · Cited by 187
Measuring ISP topologies with rocketfuel
Spring, N., Mahajan, R., & Wetherall, D. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '02 · doi:10.1145/633038.633039 · Cited by 176
Anatomy of a P2P Content Distribution system with Network Coding.
Gkantsidis, C., Miller, J. L., & Rodríguez, P. (2006) · International Workshop on Peer-to-Peer Systems · Cited by 107
Cited by
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
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
Cooperative 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
Metadata
- Authors
- Chou, P., & Wu, Y.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2007-09
- Volume
- 24
- Issue
- 5
- Pages
- 77-85
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W2143185888
- Cited by
- 253
- References
- 25
- FWCI
- 33.50
- 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.