Construct · 1 fields · 1 citations

Johnson bound: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Coding theory

upper bound on the size of error-correcting codes with a given length and minimum distance, also used to limit the radius of list decoding.

In coding theory, Johnson bound refers to upper bound on the size of error-correcting codes with a given length and minimum distance, also used to limit the radius of list decoding. This meaning comes from Johnson (1962) in IEEE Transactions on Information Theory.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Johnson bound sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

information4 fields · 5 citationsjingle · one word, four constructs limit3 fields · 3 citationsjingle · one word, three constructs list1 fields · 1 citationsanchor · a standalone construct

References

Johnson, S. (1962). A new upper bound for error-correcting codes. IEEE Transactions on Information Theory, 8(3), 203-207. https://doi.org/10.1109/tit.1962.1057714

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct