2 papers
cs.IT2026
Minimum Energy per Bit of Unsourced Multiple Access with Location-Based Codebook Partitioning
Deekshith Pathayappilly Krishnan, Kaan Okumus, Khac-Hoang Ngo +1
We derive finite-blocklength bounds on the minimum achievable energy per bit over a Gaussian unsourced multiple access (UMA) channel in the presence of heterogeneous path-loss cond…
cs.IT2025
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…