AI-created image
Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
sphere-packing bound
|
| gptkbp:appliesTo |
error-correcting codes
|
| gptkbp:category |
gptkb:information_theory
|
| gptkbp:equalityHoldsFor |
perfect codes
|
| gptkbp:field |
coding theory
|
| gptkbp:firstPublished |
1950
|
| gptkbp:form |
M × sum_{i=0}^{t} (n choose i) (q-1)^i ≤ q^n
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hamming bound
|
| gptkbp:location |
M = number of codewords
d = minimum distance n = code length q = alphabet size t = floor((d-1)/2) |
| gptkbp:namedAfter |
gptkb:Richard_Hamming
|
| gptkbp:relatedTo |
gptkb:Gilbert–Varshamov_bound
Singleton bound alphabet size code length code rate minimum distance |
| gptkbp:state |
the maximum number of codewords in a code with given length, minimum distance, and alphabet size
|
| gptkbp:usedFor |
bounding the size of a code
|
| gptkbp:bfsParent |
gptkb:Richard_Hamming
|
| gptkbp:bfsLayer |
4
|