In this paper, a random access scheme is introduced, which relies on the combination of
packet erasure correcting codes and successive interference cancellation (SIC). The …

We consider an uncoordinated Gaussian multiple access channel with a relatively large
number of active users within each block. A low complexity coding scheme is proposed …

The rise of machine-to-machine communications has rekindled interest in random access
protocols as a support for a massive number of uncoordinatedly transmitting devices. The …

This paper considers a grant-free random access scenario for massive machine-type
communications (mMTC) in which the devices are sporadically active with small payloads …

This work introduces a novel coding paradigm for the unsourced multiple access channel
model. The envisioned framework builds on a select few key components. First, the …

Various applications of wireless Machine-to-Machine (M2M) communications have
rekindled the research interest in random access protocols, suitable to support a large …

This short paper proposes the use of modern random access for IoT applications in 6G. A
short overview of recent advances in uncoordinated medium access is provided …

We propose a novel coding scheme for the unsourced multiple access channel model
introduced by Polyanskiy [1]. This new paradigm is composed of four main ingredients:(i) the …

This paper considers a massive random access problem in which a large number of
sporadically active devices wish to communicate with a base station (BS) equipped with …

Random access represents possibly the simplest and yet one of the best known approaches
for sharing a channel among several users. Since their introduction in the 1970s, random …