A Remark on Downlink Massive Random Access

TL;DR

This paper discusses a deterministic code construction for downlink massive random access that minimizes overhead, building on combinatorial covering arrays, improving upon previous random coding approaches.

Contribution

It introduces a deterministic, variable-length code design for DMRA that guarantees minimal overhead, leveraging combinatorial covering arrays.

Findings

Existence of deterministic codes with overhead ≤ 1 + log_2 e bits.

Code design is an instance of covering arrays in combinatorics.

Reduces overhead compared to random coding methods.

Abstract

In downlink massive random access (DMRA), a base station transmits messages to a typically small subset of active users, selected randomly from a massive number of total users. Explicitly encoding the identities of active users would incur a significant overhead scaling logarithmically with the number of total users. Recently, via a random coding argument, Song, Attiah and Yu have shown that the overhead can be reduced to within some upper bound irrespective of the number of total users. In this remark, recognizing that the code design for DMRA is an instance of covering arrays in combinatorics, we show that there exists deterministic construction of variable-length codes that incur an overhead no greater than $1 + log_2 e$ bits.