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

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

Capacity-Achieving Guessing Random Additive Noise Decoding

Open access
Duffy, Ken R., Li, Jiange, Medard, Muriel · 2019 · IEEE Transactions on Information Theory

Abstract

We introduce a new algorithm for realizing maximum likelihood (ML) decoding for arbitrary codebooks in discrete channels with or without memory, in which the receiver rank-orders noise sequences from most likely to least likely. Subtracting noise from the received signal in that order, the first instance that results in a member of the codebook is the ML decoding. We name this algorithm GRAND for Guessing Random Additive Noise Decoding. We establish that GRAND is capacity-achieving when used with random codebooks. For rates below capacity, we identify error exponents, and for rates beyond capacity, we identify success exponents. We determine the scheme's complexity in terms of the number of computations that the receiver performs. For rates beyond capacity, this reveals thresholds for the number of guesses by which, if a member of the codebook is identified, that it is likely to be the transmitted code word. We introduce an approximate ML decoding scheme where the receiver abandons the search after a fixed number of queries, an approach we dub GRANDAB, for GRAND with ABandonment. While not an ML decoder, we establish that the algorithm GRANDAB is also capacity-achieving for an appropriate choice of abandonment threshold, and characterize its complexity, error, and success exponents. Worked examples are presented for Markovian noise that indicate these decoding schemes substantially outperform the brute force decoding approach.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1109/tit.2019.2896110

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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

  • Guessing and entropy

    Massey, J. L. (2002) · Proceedings of 1994 IEEE International Symposium on Information Theory · doi:10.1109/isit.1994.394764 · Cited by 463 · cited 1×

    “…used in the papers referenced above are essentially based on variants and refinements of the Large Deviation Principle (LDP) for empirical measures, we instead analyze our proposed approach starting from a completely distinct angle: the recently established LDP [1] for Massey’s guesswork [14].”
    Method

Show all 1 references

Cited by

See all 221

Metadata

Authors
Duffy, K. R., Li, J., & Medard, M.
Venue
IEEE Transactions on Information Theory
Published
2019-07
Volume
65
Issue
7
Pages
4023-4040
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2954103209
Cited by
221
References
1
FWCI
8.12
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: Capacity-Achieving Guessing Random Additive Noise Decoding. https://app.cochat.ai/papers/10.1109/tit.2019.2896110
The paper
Duffy, K. R., Li, J., & Medard, M. (2019). Capacity-Achieving Guessing Random Additive Noise Decoding. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2019.2896110

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.