theoretical-computer-science / Coding theory
What is the maximum size of a binary code of given minimum distance? The linear-programming bounds of McEliece, Rodemich, Rumsey and Welch (1977) resisted improvement for half a century. The new upper bounds are exponentially stronger at every prescribed distance, with analogous results for high-dimensional spherical codes.
Temporal state
No reconciled state yet.
Append-only history
exponential improvement over the 1977 MRRW bounds; the exact rate-distance trade-off remains open
Research memory
What is the maximum size of a binary code of given minimum distance? The linear-programming bounds of McEliece, Rodemich, Rumsey and Welch (1977) resisted improvement for half a century. The new upper bounds are exponentially stronger at every prescribed distance, with analogous results for high-dimensional spherical codes.
exponential improvement over the 1977 MRRW bounds; the exact rate-distance trade-off remains open
Evidence graph
No public relationships recorded yet.