Minimax Converse for Identification via Channels

11/30/2020
by   Shun Watanabe, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/30/2018

Secure and Robust Identification via Classical-Quantum Channels

We study the identification capacity of classical-quantum channels ("cq-...
research
05/13/2020

Stealth Communication with Vanishing Power over Binary Symmetric Channels

A framework for stealth communication with vanishing power (VP) is prese...
research
04/05/2023

A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels

Reed-Muller codes were introduced in 1954, with a simple explicit constr...
research
06/20/2023

Deterministic Identification Over Multiple-Access Channels

Deterministic identification over K-input multiple-access channels with ...
research
12/21/2017

Error-Free Communication Over State-Dependent Channels with Variable-Length Feedback

The zero-error capacity of state-dependent channels with noiseless feedb...
research
07/07/2022

Identification based on random coding

Ahlswede and Dueck showed possibility to identify with high probability ...
research
01/22/2021

Beurling-type density criteria for system identification

This paper addresses the problem of identifying a linear time-varying (L...

Please sign up or login with your details

Forgot password? Click here to reset