The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Coding for Errors and Erasures in Random Network Coding
Open accessAbstract
The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer characteristic. Motivated by the property that linear network coding is vector-space preserving, information transmission is modeled as the injection into the network of a basis for a vector space$V$and the collection by the receiver of a basis for a vector space$U$. A metric on the projective geometry associated with the packet space is introduced, and it is shown that a minimum-distance decoder for this metric achieves correct decoding if the dimension of the space$V \cap U$is sufficiently large. If the dimension of each codeword is restricted to a fixed integer, the code forms a subset of a finite-field Grassmannian, or, equivalently, a subset of the vertices of the corresponding Grassmann graph. Sphere-packing and sphere-covering bounds as well as a generalization of the Singleton bound are provided for such codes. Finally, a Reed–Solomon-like code construction, related to Gabidulin's construction of maximum rank-distance codes, is described and a Sudan-style “list-1” minimum-distance decoding algorithm is provided.
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
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
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-citationAlgebraic Coding Theory: Revised Edition
Berlekamp, E. R. (2015) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,474
Brouwer, A. E., & Haemers, W. H. (2011) · Universitext · doi:10.1007/978-1-4614-1939-6_12 · Cited by 1,987
Lidl, R. (1983) · Cited by 1,390
Zheng, L., & Tse, D. N. C. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.978730 · Cited by 986
Roth, R. (2006) · doi:10.1017/cbo9780511808968 · Cited by 912 · cited 1×
“We expect to be able to recover V from U provided that ρ + t D/ 2 = ℓ − k + 1, and we will describe a Sudan-style “list-1” minimum distance decoding algorithm to do so (see, e.g., [27, Sec.”
MethodNetwork 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
Network Error Correction, II: Lower Bounds
Cai, N., Cai, N., Yeung, R. W., & Yeung, R. W. (2006) · Communications in Information and Systems · doi:10.4310/cis.2006.v6.n1.a3 · Cited by 220
Network 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
Cited by
Reliable Physical Layer Network Coding
Nazer, B., & Gastpar, M. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2094170 · Cited by 276
Metadata
- Authors
- Koetter, R., & Kschischang, F. R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-08
- Volume
- 54
- Issue
- 8
- Pages
- 3579-3591
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2139416652
- Cited by
- 1,053
- References
- 11
- FWCI
- 117.67
- Type
- journal article
- Language
- en
- Open access
- green
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: Coding for Errors and Erasures in Random Network Coding. https://app.cochat.ai/papers/10.1109/tit.2008.926449
- The paper
- Koetter, R., & Kschischang, F. R. (2008). Coding for Errors and Erasures in Random Network Coding. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2008.926449
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.