3 research outputs found
On Identifying a Massive Number of Distributions
Finding the underlying probability distributions of a set of observed
sequences under the constraint that each sequence is generated i.i.d by a
distinct distribution is considered. The number of distributions, and hence the
number of observed sequences, are let to grow with the observation blocklength
. Asymptotically matching upper and lower bounds on the probability of error
are derived.Comment: Under Submissio
The Strongly Asynchronous Massive Access Channel
This paper considers a Strongly Asynchronous and Slotted Massive Access
Channel (SAS-MAC) where different users transmit a randomly
selected message among ones within a strong asynchronous window
of length blocks, where each block lasts channel uses. A
global probability of error is enforced, ensuring that all the users'
identities and messages are correctly identified and decoded. Achievability
bounds are derived for the case that different users have similar channels, the
case that users' channels can be chosen from a set which has polynomially many
elements in the blocklength , and the case with no restriction on the users'
channels. A general converse bound on the capacity region and a converse bound
on the maximum growth rate of the number of users are derived.Comment: under submissio