Limits RegistryPUBLIC RECORDLimits RegistryResearch Console →Greedy lower bound on the size of a binary code with prescribed minimum Hamming distance.
The question, scope, and sources behind this Registry record.
Lower-bound the maximum number of binary length-n codewords having pairwise Hamming distance at least d.
Current frontiers derived from accepted Claims.
Assertions tied to evidence, attribution, and review.
The frontier as it changed over time.
Only accepted Claims matching the current specification contribute to the displayed bounds. Strict inequalities remain open; contradictory Claims require editorial review.
No accepted machine-checked reproductions are recorded for this Limit.
Limits Registry. LR-003220. Gilbert–Varshamov achievable coding bound. 2026.