Minimax Converse for Identification via Channels
Information Theory
2021-01-15 v2 math.IT
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.
Cite
@article{arxiv.2011.14741,
title = {Minimax Converse for Identification via Channels},
author = {Shun Watanabe},
journal= {arXiv preprint arXiv:2011.14741},
year = {2021}
}
Comments
18 pages, no figure