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

We present finite-blocklength achievability bounds for the unsourced A-channel. In this
multiple-access channel, users noiselessly transmit codewords picked from a common …

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 …

The proliferation of machine‐type devices has underscored the need of a solution for
efficient and scalable wireless access for a massive number of users in a cell. Many‐user …

This paper considers the Gaussian multiple-access channel in the asymptotic regime where
the number of users grows linearly with the code length. We propose efficient coding …

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 …

We consider communication over the Gaussian multiple-access channel in the regime
where the number of users grows linearly with the codelength. We investigate coded CDMA …

This study employs a Stackelberg game-theoretic framework to investigate anti-jamming
strategies in cognitive radio networks. The study assesses the efficiency of primary and …

This thesis studies two high-dimensional statistical estimation problems: matrix sketching,
and communication over many-user channels. Efficient recovery schemes, based on belief …

In the emerging Internet of Things, a massive number of devices may connect to one
common receiver. Consequently, models that study this setting are variants of the classical …