Metraipolis › archive › dc_bd515298a559

Exact Joint MAP Decoding for Unknown Load and Message Counts in Orthogonal Unsourced Random Access — arXiv:2610.20389

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.20389
License (as archived)
CC0-1.0
Archived
2026-10-15T14:36:18.544Z
SHA-256 of the archived text
1d3c50df2fd0a404da5be56b85b20dc045dcf5091eb12caf8345b1802e5f6ac7
Stable URL of this page
https://metraipolis.com/documento/dc_bd515298a559

How to cite

Exact Joint MAP Decoding for Unknown Load and Message Counts in Orthogonal Unsourced Random Access — arXiv:2610.20389 — arXiv (en), https://arxiv.org/abs/2610.20389 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bd515298a559 (Metraipolis archive dc_bd515298a559, sha256 1d3c50df2fd0a404da5be56b85b20dc045dcf5091eb12caf8345b1802e5f6ac7)
BibTeX
@misc{dcbd515298a559,
  title = {Exact Joint MAP Decoding for Unknown Load and Message Counts in Orthogonal Unsourced Random Access — arXiv:2610.20389},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.20389},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bd515298a559; sha256 1d3c50df2fd0a404da5be56b85b20dc045dcf5091eb12caf8345b1802e5f6ac7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.20389. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 of the transmitted messages. For arbitrary load and message priors, we propose an exact joint maximum-a-posteriori (MAP) decoder. Known-load allocation is separable and convex; our contribution is to show that the solutions for all candidate loads are nested prefixes of one greedy chain. Scoring these prefixes with the Bayesian posterior terms jointly estimates the load and message-count vector in $O(M+K_{\max}\log M)$ time. We compare the proposed joint MAP decoder with marginal MAP, three scalar-count two-stage receivers, oracle-load MAP, a sum-only receiver, and a soft-pilot receiver. For $K\sim\operatorname{Unif}\{0{:}60\}$ at 2 dB, the proposed decoder cuts the no-activity false-alarm probability from $25.9\%$ to $3.5\%$ relative to the Bayesian-count two-stage receiver and, conditioned on $K\ge1$, reduces normalized count error by $21.4\%$. The advantage concentrates under idle or sparse uncertain activity, whereas support-count processing approaches joint MAP when the possible loads are well separated. We also prove that the sum-only statistic is insufficient and quantify prior and amplitude mismatch. The model targets synchronized, power-controlled, very-short payloads rather than general URA.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.20389 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T13:57:05.404Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).