The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
An algebraic approach to network coding
Abstract
We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al.(see Proc. 2001 IEEE Int. Symp. Information Theory, p.102), who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary networks and robust networking. For networks which are restricted to using linear network codes, we find necessary and sufficient conditions for the feasibility of any given set of connections over a given network. We also consider the problem of network recovery for nonergodic link failures. For the multicast setup we prove that there exist coding strategies that provide maximally robust networks and that do not require adaptation of the network interior to the failure pattern in question. The results are derived for both delay-free networks and networks with delays.
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
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
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5053 · Cited by 2,034
Cover, T. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054727 · Cited by 1,670
Three-terminal communication channels
van der Meulen, E. C. (1971) · Advances in Applied Probability · doi:10.1017/s0001867800037605 · Cited by 1,544
Network Optimization: Continuous and Discrete Models
Bertsekas, D. P. (1998) · Cited by 1,027
Ideals, Varieties, and Algorithms
Cox, D. H., Little, J. B., & O’Shea, D. (1992) · Undergraduate texts in mathematics · doi:10.1007/978-1-4757-2181-2 · Cited by 1,002
Multi-way communication channels
Ahlswede, R. (1973) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 615
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
Cited by
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
Self-citationXORs 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
Self-citationNetwork 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
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
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
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
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601982414 · Cited by 686
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
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
Self-citationXORs 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
Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
Sundaram, S., & Hadjicostis, C. N. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2088690 · Cited by 472
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
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
(2006) · Springer eBooks · doi:10.1007/1-4020-4711-8 · Cited by 363
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
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
Fragouli, C., & Soljanin, E. (2006) · now publishers, Inc. eBooks · doi:10.1561/9781601980335 · Cited by 288
Network deconvolution as a general method to distinguish direct dependencies in networks
Feizi, S., Marbach, D., Médard, M., & Kellis, M. (2013) · Nature Biotechnology · doi:10.1038/nbt.2635 · Cited by 287
Kramer, G., Marić, I., & Yates, R. D. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · 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
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
Self-citationDistributed strategies for average consensus in directed graphs
Domínguez-García, A. D., & Hadjicostis, C. N. (2011) · 2011 50th IEEE Conference on Decision and Control and European Control Conference · doi:10.1109/cdc.2011.6160462 · Cited by 75
Hai, D. T. (2019) · Telecommunication Systems · doi:10.1007/s11235-018-0474-9 · Cited by 32
Metadata
- Authors
- Koetter, R., & Medard, M.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2003-10
- Volume
- 11
- Issue
- 5
- Pages
- 782-795
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2138928022
- Cited by
- 2,356
- References
- 13
- FWCI
- 77.69
- 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.