OpenAlex
metadata only
Information Theory: Coding Theorems for Discrete Memoryless Systems
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
- Keyless secrecy against bounded adversaries#1000211
- Infinite families of 3-designs from linear and nonlinear codes#1109523
- Asymptotically Optimal List Size of Random Linear Codes#821054
- Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting#388253
- Exponential, Finite-Time and Fixed-Time Small-Gain Theorems for Interconnected Systems#142586
Record · ID 6618
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