Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,053

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 access
Koetter, Ralf, Kschischang, Frank R.·2008·IEEE Transactions on Information Theory

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2008.926449

Cites

11 of 11 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 11 references

Cited by

See all 1,053

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.