arXiv (All)
open access
From Symmetry to Capacity: Nested Codes on Binary Memoryless Symmetric Channels
The past decade has seen notable advances in our understanding of structured error-correcting codes, particularly binary Reed-Muller (RM) codes. While initial breakthroughs were for erasure channels based on symmetry, extending these results to the binary symmetric channel (BSC) and other binary mem
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
- From Symmetry to Capacity: Nested Codes on Binary Memoryless Symmetric Channels#920808
- Asymptotically unit-rate storage codes from binary BCH codes#1157004
- New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance#139149
- A General Plotkin-type Bound on Function-Correcting Codes with Wyner-Graham Distance#798214
- A General Plotkin-type Bound on Function-Correcting Codes with Wyner-Graham Distance#796801
Record · ID 925042
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