Deutsche Nationalbibliothek
metadata only
An Elementary Proof of the First LP Bound on the Rate of Binary Codes / Nati Linial, Elyassaf Loyfer
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
- Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting#388253
- Lossy Compression via Sparse Regression Codes: Generalized Construction and Finite-length Bounds#609655
- Retained-Set Descent for Diagonal Ramsey Numbers#1084471
- Linear Programming Bounds for Locally Recovery Codes II#1110437
- Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback#640066
Record · ID 1188578
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