Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Massive Uncoordinated Access With Random User Activity   We extend the seminal work by Polyanskiy (2017) on massive uncoordinated
access to the case where the number of active users is random and unknown a
priori. We define a random-access code accounting for both misdetection (MD)
and false alarm (FA), and derive a random-coding achievability bound for the
Gaussian multiple-access channel. Our bound captures the fundamental trade-off
between MD and FA probabilities. The derived bound suggests that, for the
scenario considered in Polyanskiy (2017), lack of knowledge of the number of
active users entails a small penalty in terms of power efficiency. For example,
our bound shows that 0.5-0.7 dB extra power is required to achieve both MD and
FA probabilities below 0.1 compared to the case in which the number of active
users is known a priori. Taking both MD and FA into account, we show that some
of the recently proposed massive random access schemes are highly suboptimal
with respect to our bound.

30
The categories of this paper are: q-alg
27
The categories of this paper are: comp-gas
11
The categories of this paper are: hep-lat
36
The categories of this paper are: cmp-lg
4
The categories of this paper are: cond-mat
16
The categories of this paper are: stat
8
The categories of this paper are: hep-ex
26
The categories of this paper are: bayes-an
3
The categories of this paper are: physics
31
The categories of this paper are: ao-sci
7
The categories of this paper are: hep-th
14
The categories of this paper are: math-ph
28
The categories of this paper are: alg-geom
5
The categories of this paper are: gr-qc
18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph