arXiv (All)
open access
Comments on the recent improvements of the MRRW bounds
The asymptotic McEliece--Rodemich--Rumsey--Welch bound (1977) limits the largest attainable rate of binary codes as a function of the relative distance. After a nearly half-century hiatus, this result was recently improved in two concurrent works, by OpenAI and by O. Alrabiah and V. Guruswami. The t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On Twisted Roth-Lempel Codes#1123676
- Improved Bounds for Cross-Sperner Systems#628828
- A Tight Second-Order Lower Bound for Routing Labels in Trees#1154933
- Toward Universal Belief Propagation Decoding for Short Binary Block Codes#135308
- Unified Common-Root and Interpolation Bounds Based on Leading Monomial Data#1052072
Record · ID 822282
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive