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

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Lower bounds to error probability for coding on discrete memoryless channels. II

Open access
Shannon, C.E., Gallager, R.G., Berlekamp, E.R.·1967·Information and Control

Abstract

New lower bounds are presented for the minimum error probability that can be achieved through the use of block coding on noisy discrete memoryless channels. Like previous upper bounds, these lower bounds decrease exponentially with the block length N. The coefficient of N in the exponent is a convex function of the rate. From a certain rate of transmission up to channel capacity, the exponents of the upper and lower bounds coincide. Below this particular rate, the exponents of the upper and lower bounds differ, although they approach the same limit as the rate approaches zero. Examples are given and various incidental results and techniques relating to coding theory are developed. The paper is presented in two parts: the first, appearing here, summarizes the major results and treats the case of high transmission rates in detail; the second, to appear in the subsequent issue, treats the case of low transmission rates.

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.1016/s0019-9958(67)91200-4

Cites

1 of 1 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 1 references

Cited by

See all 384

Metadata

Authors
Shannon, C. E., Gallager, R. G., & Berlekamp, E. R.
Venue
Information and Control
Publisher
Elsevier BV
Published
1967-05
Volume
10
Issue
5
Pages
522-552
ISSN
0019-9958 (ISSN-L)
OpenAlex
W2005530146
Cited by
384
References
1
FWCI
30.75
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: Lower bounds to error probability for coding on discrete memoryless channels. II. https://app.cochat.ai/papers/10.1016/s0019-9958(67)91200-4
The paper
Shannon, C. E., Gallager, R. G., & Berlekamp, E. R. (1967). Lower bounds to error probability for coding on discrete memoryless channels. II. Information and Control. https://doi.org/10.1016/s0019-9958(67)91200-4

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.