Minimax Converse for Identification via Channels

DOI10.1109/TIT.2021.3120033MaRDI QIDQ5030265zbMATH OpenOpenAlexFDO

Authors Shun Watanabe

Publication date 17 February 2022

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

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

zbMATH Keywords

error probabilityidentification capacityoptimal second-order coding ratepartial channel resolvability

Mathematics Subject Classification ID

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

Abstract: A minimax converse for the identification via channels is derived. By this converse, a general formula for the identification capacity, which coincides with the transmission capacity, is proved without the assumption of the strong converse property. Furthermore, the optimal second-order coding rate of the identification via channels is characterized when the type I error probability is non-vanishing and the type II error probability is vanishing. Our converse is built upon the so-called partial channel resolvability approach; however, the minimax argument enables us to circumvent a flaw reported in the literature.

Cited in

(2)

• Identification over quantum broadcast channels
• Converse techniques for identification via channels

This page was built for publication: Minimax Converse for Identification via Channels

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