Deterministic Identification Over Channels With Power Constraints

DOI10.1109/TIT.2021.3122811zbMATH Open1487.94082arXiv2010.04239OpenAlexW3208790331MaRDI QIDQ5030264FDOQ5030264

Authors: Mohammad J. Salariseddigh, Uzi Pereg, Holger Boche, Christian Deppe 

Publication date: 17 February 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: The identification capacity is developed without randomization at neither the encoder nor the decoder. In particular, full characterization is established for the deterministic identification (DI) capacity for the Gaussian channel and for the general discrete memoryless channel (DMC) with and without constraints. Originally, Ahlswede and Dueck established the identification capacity with local randomness given at the encoder, resulting in a double exponential number of messages in the block length. In the deterministic setup, the number of messages scales exponentially, as in Shannon's transmission paradigm, but the achievable identification rates can be significantly higher than those of the transmission rates. Ahlswede and Dueck further stated a capacity result for the deterministic setting of a DMC, but did not provide an explicit proof. In this paper, a detailed proof is given for both the Gaussian channel and the general DMC. The DI capacity of a Gaussian channel is infinite regardless of the noise.

Full work available at URL: https://arxiv.org/abs/2010.04239

zbMATH Keywords

discrete memoryless channeldeterministic identification capacityGaussian channels with fast and slow fading

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Cited In (1)

• Approximate channel identification via?-signed correlation

This page was built for publication: Deterministic Identification Over Channels With Power Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030264)