Hamming bound

limit on the parameters of a block code
Thing Inequation Q1970635

Facts

4 properties
Defining formula
A_q(n,d) \leq \frac{q^n}{\sum_{k=0}^{\left\lfloor(d-1)/2\right\rfloor} \binom{n}{k}(q-1)^k}[4]
In defining formula
n, d, k[5][6][7]
🏷️ Also known as
en Hamming bound en sphere-packing bound en volume bound de Hamming-Schranke fa محدوده همینگ fr borne de Hamming ja ハミング限界 pt Cota de Hamming ru Граница сферической упаковки ru Граница Хемминга ru Граница Хэмминга uk межа Геммінга
🔖 Identifiers · 3
OpenAlex ID
C166530166
Freebase ID
/m/0636_h
Microsoft Academic ID (discontinued)
166530166

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Instance of 2
Created notable works 1
Named after 1
Press Enter · cited answer in seconds

Summary

Hamming bound is an inequation[1].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Hamming bound. Retrieved November 17, 2026, from https://4ort.xyz/entity/hamming-bound
MLA “Hamming bound.” 4ort.xyz Knowledge Graph, 4ort.xyz, 17 Nov. 2026, https://4ort.xyz/entity/hamming-bound.
BibTeX @misc{4ortxyz_hamming-bound_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Hamming bound}}, year = {2026}, url = {https://4ort.xyz/entity/hamming-bound}, note = {Accessed: 2026-11-17}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Hamming bound — https://4ort.xyz/entity/hamming-bound (retrieved 2026-11-17)

Canonical URL: https://4ort.xyz/entity/hamming-bound · Last refreshed: