Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Plotkin bound · Vinony

🌐English

English Deutsch Русский 日本語

EntityQ1476195· pop 5· linked from 10 articles

Plotkin bound

limit on the number of codewords in binary codes of given length and minimum distance

Available in 5 languages

Deutsch
日本語
Русский
Hebrew

via Wikidata sitelinks · CC0

Connections

digital object identifier

Categories

Sources

wikipedia.externallinksexternallink

vector space

Entity

floor and ceiling functions

Hamming distance

Singleton bound

Gilbert–Varshamov bound

IEEE Transactions on Information Theory

Sign in to save

What links here10 pages

Gilbert–Varshamov bound

Singleton bound

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Gilbert–Varshamov bound

Entitydist 0.41

Entitydist 0.44

Noisy-channel coding theorem

Entitydist 0.61

Entitydist 0.62

space complexity

Entitydist 0.66

semantic similarity

Entitydist 0.72

Rademacher Complexity

Entitydist 0.74

Karp's 21 NP-complete problems

Entitydist 0.74

rxponential hierarchy

Entitydist 0.76

Entitydist 0.77

Dinic's algorithm

Entitydist 0.77

quantum complexity theory

Entitydist 0.77