Deterministic Identification Over Multiple-Access Channels

by   Johannes Rosenberger, et al.

Deterministic identification over K-input multiple-access channels with average input cost constraints is considered. The capacity region for deterministic identification is determined for an average-error criterion, where arbitrarily large codes are achievable. For a maximal-error criterion, upper and lower bounds on the capacity region are derived. The bounds coincide if all average partial point-to-point channels are injective under the input constraint, i.e. all inputs at one terminal are mapped to distinct output distributions, if averaged over the inputs at all other terminals. The achievability is proved by treating the MAC as an arbitrarily varying channel with average state constraints. For injective average channels, the capacity region is a hyperrectangle. The modulo-2 and modulo-3 binary adder MAC are presented as examples of channels which are injective under suitable input constraints. The binary multiplier MAC is presented as an example of a non-injective channel, where the achievable identification rate region still includes the Shannon capacity region.


page 1

page 2

page 3

page 4


The Capacity Region of the Arbitrarily Varying MAC: With and Without Constraints

We determine both the random code capacity region and the deterministic ...

A Second-Order Converse Bound for the Multiple-Access Channel via Wringing Dependence

A new converse bound is presented for the two-user multiple-access chann...

Bounds on Capacity Region of Optical Intensity Multiple Access Channel

This paper provides new inner and outer bounds on the capacity region of...

Capacity Region of Asynchronous Multiple Access Channels with FTN

This paper studies the capacity region of asynchronous multiple access c...

Minimax Converse for Identification via Channels

A minimax converse for the identification via channels is derived. By th...

The Multiple-Access Channel with Entangled Transmitters

Communication over a classical multiple-access channel (MAC) with entang...

Byzantine Multiple Access

We study communication over multiple access channels (MAC) where one of ...

Please sign up or login with your details

Forgot password? Click here to reset