Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2107.06061 · IEEE Globecom Workshops (GC Wkshps)

Deterministic Identification Over Poisson Channels

Mohammad J. Salariseddigh, Uzi Pereg, Holger Boche, Christian Deppe, Robert Schober

Published Dec 1, 2021• 20 citations
arXivHTMLPDF

Abstract

Deterministic identification (DI) for the discrete-time Poisson channel, subject to an average and a peak power constraint, is considered. It is established that the code size scales as 2(nlogn)R, where n and R are the block length and coding rate, respectively. The authors have recently shown a similar property for Gaussian channels [1]. Lower and upper bounds on the DI capacity of the Poisson channel are developed in this scale. Those imply that the DI capacity is infinite in the exponential scale, regardless of the dark current, i.e., the channel noise parameter.

DOI
10.1109/gcwkshps52748.2021.9682110

Related papers

Deterministic Identification Over Channels With Power Constraints

Mohammad J. Salariseddigh, Uzi Pereg, Holger Boche +1 more

Identification capacity is developed without randomization at neither the encoder nor the decoder. In particular, full characterization is established for the deterministic identification (DI) capacity for the Gaussian channel and for the general discrete memoryless channel (DMC) with and without constraints. Originally, Ahlswede and Dueck established the identification capacity with local randomness given at the encoder, resulting in a double exponential number of messages. In the deterministic setup, the number of messages scales exponentially, as in Shannon’s transmission paradigm, but the achievable identification rates can be significantly higher than those of transmission. Ahlswede and Dueck further stated a capacity result for the deterministic setting of a DMC, but did not provide an explicit proof. In this paper, a detailed proof is given for both the Gaussian channel and the general DMC. The DI capacity of a Gaussian channel is infinite regardless of the noise.

arXiv:2010.04239•IEEE Transactions on Information Theory•Jun 1, 2021•19 citations

Deterministic Identification Over Channels With Finite Output: A Dimensional Perspective on Superlinear Rates

Pau Colomer, Christian Deppe, Holger Boche +1 more

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.

arXiv:2402.09117•IEEE Transactions on Information Theory•Jan 17, 2025•18 citations

Improved Capacity Upper Bounds for the Discrete-Time Poisson Channel

Mahdi Cheraghchi, João Ribeiro

We present new capacity upper bounds for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed by one of the authors for the seemingly unrelated problem of upper bounding the capacity of binary deletion and repetition channels. Previously, the best known capacity upper bound in the regime where the average-power constraint does not approach zero was due to Martinez (JOSA B, 2007), which we re-derive as a special case of our framework. Furthermore, we instantiate our framework to obtain a closed-form bound that noticeably improves the result of Martinez everywhere.

arXiv:1801.02745•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•7 citations

Deterministic Identification Over Channels with Finite Output: A Dimensional Perspective on Superlinear Rates

Pau Colomer, Christian Deppe, Holger Boche +1 more

Following initial work by JaJa, and 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 (the closure of) the subset of its output distributions in the probability simplex. Our main findings are that the maximum number of messages thus identifiable scales super-exponentially as$2^{Rn\log n}$with the block length$n$, and that the optimal rate$R$is upper and lower 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$, Along the way, we present a Hypothesis Testing Lemma that shows 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 super-activation: there exist channels whose capacity is zero, but whose product has positive capacity. These results are then generalised to classical-quantum channels with finite-dimensional output quantum system (but arbitrary input alphabet), and in particular to quantum channels on finite-dimensional quantum systems under the constraint that the identification code can only use tensor product inputs.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•13 citations

On identification capacity of infinite alphabets or continuous-time channels

M. V. Burnashev

Two kinds of channels are considered: (1) discrete-time channel with additive noise, and (2) Poisson and white Gaussian (i.e., continuous-time) channels. For the type (1) channel there are given some sufficient conditions when the Shannon and identification capacities coincide. It is shown that the identification capacity of Poisson and Gaussian channels without bandwidth constraint is infinite. Conversely, for a white Gaussian channel with bandwidth constraint, the identification capacity coincides with the Shannon capacity.

IEEE Transactions on Information Theory•Jan 1, 2000•24 citations

Error probability of identification via channels at rates above capacity

Yasutada Oohama

In the identification via channels (the ID-channel), under some condition for noisy channels, the sum of two types of error probabilities of identification goes to one at rates of codes above capacity when the length of codes tends to infinity. This is known as a strong converse property of the ID-channel. In this paper we derive an exponential lower bound for the sum of two error probabilities to tend to one. In particular, for the class of discrete memoryless channels, we explicitly compute this lower bound.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2003•3 citations
Deterministic identification (DI) for the discrete-time Poisson channel, subject to an average and a peak power constraint, is considered. It is established that the code size scales as 2(nlogn)R, where n and R are the block length and coding rate, respectively. The authors have recently shown a similar property for Gaussian channels [1]. Lower and upper bounds on the DI capacity of the Poisson channel are developed in this scale. Those imply that the DI capacity is infinite in the exponential scale, regardless of the dark current, i.e., the channel noise parameter.
Identification capacity is developed without randomization at neither the encoder nor the decoder. In particular, full characterization is established for the deterministic identification (DI) capacity for the Gaussian channel and for the general discrete memoryless channel (DMC) with and without constraints. Originally, Ahlswede and Dueck established the identification capacity with local randomness given at the encoder, resulting in a double exponential number of messages. In the deterministic setup, the number of messages scales exponentially, as in Shannon’s transmission paradigm, but the achievable identification rates can be significantly higher than those of transmission. Ahlswede and Dueck further stated a capacity result for the deterministic setting of a DMC, but did not provide an explicit proof. In this paper, a detailed proof is given for both the Gaussian channel and the general DMC. The DI capacity of a Gaussian channel is infinite regardless of the noise.
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 asR nlog⁡nR\,n\log nRnlognwith 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:14d≤R≤12d\frac {1}{4} d \leq R \leq \frac {1}{2} d41​d≤R≤21​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.
We present new capacity upper bounds for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed by one of the authors for the seemingly unrelated problem of upper bounding the capacity of binary deletion and repetition channels. Previously, the best known capacity upper bound in the regime where the average-power constraint does not approach zero was due to Martinez (JOSA B, 2007), which we re-derive as a special case of our framework. Furthermore, we instantiate our framework to obtain a closed-form bound that noticeably improves the result of Martinez everywhere.
Following initial work by JaJa, and 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 (the closure of) the subset of its output distributions in the probability simplex. Our main findings are that the maximum number of messages thus identifiable scales super-exponentially as2Rnlog⁡n2^{Rn\log n}2Rnlognwith the block lengthnnn, and that the optimal rateRRRis upper and lower bounded in terms of the covering (aka Minkowski, or Kolmogorov, or entropy) dimensiondddof a certain algebraic transformation of the output set:14d≤R≤12d\frac{1}{4}d\leq R\leq\frac{1}{2}d41​d≤R≤21​d, Along the way, we present a Hypothesis Testing Lemma that shows 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 super-activation: there exist channels whose capacity is zero, but whose product has positive capacity. These results are then generalised to classical-quantum channels with finite-dimensional output quantum system (but arbitrary input alphabet), and in particular to quantum channels on finite-dimensional quantum systems under the constraint that the identification code can only use tensor product inputs.
Two kinds of channels are considered: (1) discrete-time channel with additive noise, and (2) Poisson and white Gaussian (i.e., continuous-time) channels. For the type (1) channel there are given some sufficient conditions when the Shannon and identification capacities coincide. It is shown that the identification capacity of Poisson and Gaussian channels without bandwidth constraint is infinite. Conversely, for a white Gaussian channel with bandwidth constraint, the identification capacity coincides with the Shannon capacity.
In the identification via channels (the ID-channel), under some condition for noisy channels, the sum of two types of error probabilities of identification goes to one at rates of codes above capacity when the length of codes tends to infinity. This is known as a strong converse property of the ID-channel. In this paper we derive an exponential lower bound for the sum of two error probabilities to tend to one. In particular, for the class of discrete memoryless channels, we explicitly compute this lower bound.