Construct · 1 fields · 1 citations

Gilbert-Varshamov bound: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
Gilbert-Varshamovbound1 CONSTRUCTGilbert-Varshamov boundGILBERT · CODING THEORY

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

Coding theory

a guarantee that codes exist with at least a certain number of codewords for a given length and minimum distance.

In coding theory, Gilbert-Varshamov bound refers to a guarantee that codes exist with at least a certain number of codewords for a given length and minimum distance. This meaning comes from Gilbert (1952) in Bell System Technical Journal.[1]

Unit
Recovery means
Measured by

Next

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

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

Open in ColliderExport BibTeXReport this entry

Nearby constructs

number3 fields · 6 citationsjingle · one word, three constructs

References

  1. Gilbert, E. N. (1952). A Comparison of Signalling Alphabets. Bell System Technical Journal, 31(3), 504-522. https://doi.org/10.1002/j.1538-7305.1952.tb01393.x

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