Theoremcore
Hamming bound
Also called sphere-packing bound.
Upper bound on the size of a code correcting t errors, from disjointness of Hamming balls.
Upper bound on the size of a code correcting t errors, from disjointness of Hamming balls.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 39271D Edit this page History Report an error