The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
A Random Linear Network Coding Approach to Multicast
Abstract
We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. We show that this achieves capacity with probability exponentially approaching 1 with the code length. We also demonstrate that random linear coding performs compression when necessary in a network, generalizing error exponents for linear Slepian-Wolf coding in a natural way. Benefits of this approach are decentralized operation and robustness to network changes or link failures. We show that this approach can take advantage of redundant network capacity for improved success probability and robustness. We illustrate some potential advantages of random linear network coding over routing in two examples of practical scenarios: distributed network operation and networks with dynamically varying connections. Our derivation of these results also yields a new bound on required field size for centralized network coding on general multicast 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
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
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
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
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
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
Self-citationBirman, K. P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., & Minsky, Y. (1999) · ACM Transactions on Computer Systems · doi:10.1145/312203.312207 · Cited by 654
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
Linear codes for sources and source networks: Error exponents, universal coding
Csiszar, I. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056524 · Cited by 263
Low complexity algebraic multicast network codes
Jaggi, S., Chou, P. A., & Jain, K. K. (2003) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2003.1228384 · Cited by 74
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
Self-citation
Cited by
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
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
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
Self-citationCompute-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
Metadata
- Authors
- Ho, T., Medard, M., Koetter, R., Karger, D. R., Effros, M., Shi, J., & Leong, B.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2006-10
- Volume
- 52
- Issue
- 10
- Pages
- 4413-4430
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2048235391
- Cited by
- 2,553
- References
- 11
- FWCI
- 151.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.