Construct · 1 fields · 1 citations

Plotkin 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.

Information theory

an upper bound on the number of codewords in a binary code whose minimum distance is large relative to its length.

In information theory, Plotkin bound refers to an upper bound on the number of codewords in a binary code whose minimum distance is large relative to its length. This meaning comes from Plotkin (1960) 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 Plotkin 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

code3 fields · 6 citationsjingle · one word, three constructs information4 fields · 5 citationsjingle · one word, four constructs number3 fields · 6 citationsjingle · one word, three constructs

References

Plotkin, M. (1960). Binary codes with specified minimum distance. IEEE Transactions on Information Theory, 6(4), 445-450. https://doi.org/10.1109/tit.1960.1057584

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