Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.15101 v2 pith:JI6XCKJK submitted 2021-10-28 cs.IT math.IT

Identification over Compound Multiple-Input Multiple-Output Broadcast Channels

classification cs.IT math.IT
keywords capacitybroadcastchannelidentificationchannelsmultiple-inputmultiple-outputcompound
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The identification capacity region of the compound broadcast channel is determined under an average error criterion, where the sender has no channel state information. We give single-letter identification capacity formulas for discrete channels and multiple-input multiple-output Gaussian channels under an average input constraint. The capacity theorems apply to general discrete memoryless broadcast channels. This is in contrast to the transmission setting, where the capacity is only known for special cases, notably the degraded broadcast channel and the multiple-input multiple-output broadcast channel with private messages. Furthermore, the identification capacity region of the compound multiple-input multiple-output broadcast channel can be larger than the transmission capacity region. This is a departure from the single-user behavior of identification, since the identification capacity of a single-user channel equals the transmission capacity.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.