The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Linear network coding
Abstract
Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each node is. Allowing a node to encode its received data before passing it on, the question involves optimization of the multicast mechanisms at the nodes. Among the simplest coding schemes is linear coding, which regards a block of data as a vector over a certain base field and allows a node to apply a linear transformation to a vector before passing it on. We formulate this multicast problem and prove that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.
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
Self-citationCombinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,359
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 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-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
Secure and Private Communication
Jajodia, S., Samarati, P., & Yung, M. (2025) · Springer eBooks · doi:10.1007/978-3-030-71522-9_300841 · Cited by 141
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
Cited by
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
(2006) · Springer eBooks · doi:10.1007/1-4020-4711-8 · Cited by 363
Kramer, G., Marić, I., & Yates, R. D. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · Cited by 282
Cheng, H. T., Shan, H., & Zhuang, W. (2011) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2010.11.009 · Cited by 273
Metadata
- Authors
- Li, S.-Y. R., Yeung, R. W., & Cai, N.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2003-02
- Volume
- 49
- Issue
- 2
- Pages
- 371-381
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2106403318
- Cited by
- 3,378
- References
- 7
- FWCI
- 93.84
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Linear network coding. https://app.cochat.ai/papers/10.1109/tit.2002.807285
- The paper
- Li, S.-Y. R., Yeung, R. W., & Cai, N. (2003). Linear network coding. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2002.807285
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.
