Finite-Blocklength Results for the A-channel: Applications to Unsourced Random Access and Group Testing
Finite-Blocklength Results for the A-channel: Applications to Unsourced Random Access and Group Testing
We present finite-blocklength achievability bounds for the unsourced A-channel. In this multiple-access channel, users noiselessly transmit codewords picked from a common codebook with entries generated from a <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$q$</tex> -ary alphabet. At each channel use, the receiver observes the set of different transmitted symbols but not their multiplicity. We …