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

The DOI matches its Crossref record.

Network Error Correction, II: Lower Bounds

Open access
Cai, Ning, Cai, Ning, Yeung, Raymond W., Yeung, Raymond W. · 2006 · Communications in Information and Systems

Abstract

In Part I of this paper, we introduced the paradigm of network error correction as a generalization of classical link-by-link error correction.We also obtained the network generalizations of the Hamming bound and the Singleton bound in classical algebraic coding theory.In Part II, we prove the network generalization of the Gilbert-Varshamov bound and its enhancement.With the latter, we show that the tightness of the Singleton bound is preserved in the network setting.We also discuss the implication of the results in this paper.

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.4310/cis.2006.v6.n1.a3

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.

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

Cited by

See all 220

Metadata

Authors
Cai, N., Cai, N., Yeung, R. W., & Yeung, R. W.
Venue
Communications in Information and Systems
Published
2006
Volume
6
Issue
1
Pages
37-54
ISSN
  • 1526-7555 (ISSN-L)
  • 2163-4548
OpenAlex
W2014554046
Cited by
220
References
0
FWCI
20.28
Type
journal article
Language
en
Open access
bronze

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: Network Error Correction, II: Lower Bounds. https://app.cochat.ai/papers/10.4310/cis.2006.v6.n1.a3
The paper
Cai, N., Cai, N., Yeung, R. W., & Yeung, R. W. (2006). Network Error Correction, II: Lower Bounds. Communications in Information and Systems. https://doi.org/10.4310/cis.2006.v6.n1.a3

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.