The paper analyzes the deterministic identification (DI) problem over memoryless channels with finite output alphabets. The key findings are:
1/4d ≤ R ≤ 1/2d
This superlinear scaling is in contrast to the exponential scaling of the maximum number of messages for the classical transmission problem.
The authors prove a Hypothesis Testing Lemma showing that pairwise reliable distinguishability of the output distributions is sufficient to construct a DI code.
The paper analyzes the geometry and metric properties of the output probability set, which allows bounding the DI capacity in terms of the Minkowski dimension.
Specific examples are studied, including the Bernoulli and Poisson channels, for which tight bounds on the superexponential DI capacity are derived.
The results are further generalized to classical-quantum channels with finite-dimensional output.
The paper also discusses the occurrence of optimistic and pessimistic DI capacities, and shows that the superadditivity of the lower Minkowski dimension can be exploited to prove superactivation of the DI capacity.
Para outro idioma
do conteúdo fonte
arxiv.org
Principais Insights Extraídos De
by Pau Colomer,... às arxiv.org 09-20-2024
https://arxiv.org/pdf/2402.09117.pdfPerguntas Mais Profundas