Gilbert–Varshamov-scale size of optimal binary codes
Determine whether the true size of an optimal binary error-correcting code is asymptotically near the Gilbert–Varshamov lower bound.
References
If the true size of an optimal binary code is actually near the Gilbert--Varshamov bound (as conjectured by some specialists ), then this family of relaxations needs to be substantially strengthened.
— Higher-order Delsarte Dual LPs: Lifting, Constructions and Completeness
(2501.04854 - Coregliano et al., 8 Jan 2025) in Section 1, Introduction
The binary code packing problem, which seeks to maximize the number of codewords at a fixed code length and minimum distance, is a fundamental problem in coding theory that remains open for many parameter choices.
— Three Improved Lower Bounds for Binary Error-Correcting Codes
(2610.11609 - Ota et al., 8 Oct 2026) in Abstract