An Achievability Bound for Type-Based Unsourced Multiple Access

Deekshith Pathayappilly Krishnan, Kaan Okumus, Khac-Hoang Ngo +1

We derive an achievability bound to quantify the performance of a type-based unsourced multiple access system -- an information-theoretic model for grant-free multiple access with…