arXiv (All)
open access
A Continuous Projection Converse and a Weighted Construction for Uniquely Decodable Code Pairs
We study the maximum sum rate of uniquely decodable code pairs. A weighted refinement of a complement-gluing construction yields an explicit code of length 672 and sum rate exceeding $1.318639029203$. An iterated projection argument, combined with a conditional entropy estimate and a justified conti
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
- Local Gains and Fixed-Assignment Set Losses in Shared Set Decoders#609150
- Noisy-Channel Minimum Bayes Risk Decoding#343487
- Lossy Joint Source-Channel Coding over Unknown Channels#924586
- Lossy Joint Source-Channel Coding over Unknown Channels#920354
- Dual lattice attacks for bounded distance decoding, revisited#1141805
Record · ID 1118337
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