Deterministic Identification Over Channels With Finite Output: A Dimensional Perspective on Superlinear Rates
Year: 2025
Type: article
Abstract: Following initial work by JaJa, Ahlswede and Cai, and inspired by a recent renewed surge in interest in deterministic identification (DI) via noisy channels, we consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets. Such a channel is essentially given by its output distributions as a subset in the probability simplex. Our main findings are that the maximum length of messages thus identifiable scales superlinearly as$R\,n\log n$with the block length n, and that the optimal rate R is bounded in terms of the covering (aka Minkowski, or Kolmogorov, or entropy) dimension d of a certain algebraic transformation of the output set:$\frac {1}{4} d \leq R \leq \frac {1}{2} d$. Remarkably, both the lower and upper Minkowski dimensions play a role in this result. Along the way, we present a Hypothesis Testing Lemma showing that it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code. Although we do not know the exact capacity formula, we can conclude that the DI capacity exhibits superactivation: there exist channels whose capacities individually are zero, but whose product has positive capacity. We also generalise these results to classical-quantum channels with finite-dimensional output quantum system, in particular to quantum channels on finite-dimensional quantum systems under the constraint that the identification code can only use tensor product inputs.
Authors: Pau Colomer, Christian Deppe, Holger Boche, Andreas Winter
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,645
Awards: G120905174, G1305463392, EXC 2092: CyberSicherheit im Zeitalter großskaliger Angreifer (CASA), Verbundprojekt: Quantum Physical Layer Service Integration - QuaPhySI -, G2988934680, Verbundprojekt: Post Shannon Kommunikation - NewCom -, Teilvorhaben: Grundlagen, Simulation und Demonstration für neue Kommunikationsmodelle, Verbundprojekt: Digitale Transformation und Souveränität künftiger Kommunikationsnetze - 6G-life -, Teilvorhaben: Grundlagen und Systemlösungen für Post Shannon Kommunikation, In-Network Computing, eingebettete Sicherheit und Resilienz, G357246561, G42194784, G4753493253, G531036588, Verbundprojekt: Post Shannon Kommunikation - NewCom -, Teilvorhaben: Kodierungstheorie und Kodierverfahren für neue Kommunikationsmodelle, G7094606870, Verbundprojekt: Quantentoken Theorie und Anwendungen - QTOK -, Teilvorhaben: Informations- und Kodierungstheorie für Quantentoken-basierte Authentifizierung und sichere Speicherung, G7425137858, G7472567491, G8210619067, Verbundprojekt: Digitale Transformation und Souveränität künftiger Kommunikationsnetze - 6G-life -
OpenAlex ID: W4406523905
