arXiv (All)
open access
Exact Joint MAP Decoding for Unknown Load and Message Counts in Orthogonal Unsourced Random Access
We study joint recovery of the load (the number of active users) and message-count vector in type-based unsourced random access with very short messages. Each user's $k$-bit message activates one of $M=2^k$ orthogonal resources; coherent collisions therefore produce a noisy, unnormalized histogram o
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
- Fathom: Per-Query Read Depth for Sparse Decoding over Offloaded KV Caches#1035613
- Fathom: Per-Query Read Depth for Sparse Decoding over Offloaded KV Caches#965394
- Recovery Guarantees for Posterior Sampling of One-Bit Compressed Sensing#1249114
- Information-Theoretic Foundations of Mismatched Decoding#1051929
- Estimates of the coverage of parameter space by Latin hypercube and orthogonal array-based sampling#955423
Record · ID 1355313
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