Metraipolis › archive › dc_11b8a07a3a08

A Particle-Based Multiuser Communication with a Budget Limit — arXiv:2611.07171

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07171
License (as archived)
CC0-1.0
Archived
2026-11-06T14:59:45.582Z
SHA-256 of the archived text
3e6a1d268ebb9e4a384e26af01e8c0cd4a575726bb9baf7668602a202a5ba308
Stable URL of this page
https://metraipolis.com/documento/dc_11b8a07a3a08

How to cite

A Particle-Based Multiuser Communication with a Budget Limit — arXiv:2611.07171 — arXiv (en), https://arxiv.org/abs/2611.07171 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_11b8a07a3a08 (Metraipolis archive dc_11b8a07a3a08, sha256 3e6a1d268ebb9e4a384e26af01e8c0cd4a575726bb9baf7668602a202a5ba308)
BibTeX
@misc{dc11b8a07a3a08,
  title = {A Particle-Based Multiuser Communication with a Budget Limit — arXiv:2611.07171},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07171},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_11b8a07a3a08; sha256 3e6a1d268ebb9e4a384e26af01e8c0cd4a575726bb9baf7668602a202a5ba308},
  year = {2026}
}

Archived text

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

Multiuser networks can aggregate local observations through a shared receiver. In this paper, we study the particle budget required to recover the exact sum of binary inputs in a multiuser network. We show that, for the considered model, the minimum budget grows quadratically with the number of transmitters when the symbol duration and target error probability are fixed, even when the receiver observes all particle arrival times. Simultaneous on-off keying (OOK) achieves this quadratic scaling, while any slower budget growth makes the error probability approach one at a fixed symbol duration, regardless of the transmission and decoding scheme. We then examine how this particle requirement can be reduced by allowing longer symbol durations and more counting intervals. We develop a groupwise OOK counting (GOC) scheme with staggered group releases and sequential estimation of group input sums, accounting for delayed arrivals. Our bounds show that, when reception is based on interval counts, reducing the quadratic scaling requires both the symbol duration and the number of counting intervals to grow with network size. When both grow in proportion to network size, the minimum budget becomes proportional to the number of transmitters times its logarithm.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv eess.SP, nuovi lavori del giorno).
Categorie arXiv: Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2611.07171 — 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-11-06T14:41:51.102Z dalla pagina https://arxiv.org/list/eess.SP/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).