This paper considers the massive random access problem in multiple-input multiple-output
(MIMO) quasi-static Rayleigh fading channels. Specifically, we derive achievability and …

The pressure to develop new network architectures and multiple access technologies is
driven by increasing demands on network performance, number of devices, network traffic …

Enabling ultra-reliable and low-latency communication services while providing massive
connectivity is one of the major goals to be accomplished in future wireless communication …

To account for the massive uncoordinated random access scenario, which is relevant for the
Internet of Things, Polyanskiy et al.(2017) proposed a novel formulation of the multiple …

This paper presents finite-blocklength achievability bounds for the Gaussian multiple access
channel (MAC) and random access channel (RAC) under average-error and maximal-power …

Wireless communication has traditionally been designed to connect human users. The main
design goal was to maximize the data rate while guaranteeing moderate reliability and …

We study the Gaussian multiple access channel with random user activity, in the regime
where the number of users is proportional to the code length. The receiver may know some …

An information-theoretic approach to irregular repetition slotted ALOHA (IRSA) is proposed.
In contrast with previous works, in which IRSA analysis is conducted only based on …

In recent years, the mathematical limits and algorithmic bounds for probabilistic group
testing have become increasingly well-understood, with exact asymptotic thresholds now …

In this paper, we are interested in the performance of a variable-length stop-feedback
(VLSF) code with m optimal decoding times for the binary-input additive white Gaussian …