activity
20242026
collaborators

9 papers

cs.IT2026

Deterministic identification for Bernoulli channels and related channels with continuous input

Pau Colomer, Christian Deppe, Holger Boche +1

For memoryless channels with continuous input alphabets, deterministic identification (DI) typically exhibits a linearithmic () message growth. However, the exact DI capac…

cs.IT2026

Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap

Pau Colomer, Christian Deppe, Holger Boche +1

Deterministic identification (DI) has emerged as a promising paradigm for large-scale and goal-oriented communication systems. Despite significant progress, a fundamental open prob…

cs.IT2026

Scientific Rigor and Human Warmth: Remembering Vladimir Sidorenko (1949-2025)

Christian Deppe, Haider Al Kim, Jessica Bariffi +4

During the Foundations of Future Communication Systems (FFCS) conference in Braunschweig, a dedicated memorial session was held in honor of Dr. Vladimir (Volodya) Sidorenko (1949-2…

cs.IT2026

Rate-Reliability Tradeoff for Deterministic Identification over Gaussian Channels

Pau Colomer, Christian Deppe, Holger Boche +1

We extend the recent analysis of the rate-reliability tradeoff in deterministic identification (DI) to general linear Gaussian channels, marking the first such analysis for channel…

cs.IT2025

Rate-reliability tradeoff for deterministic identification

Pau Colomer, Christian Deppe, Holger Boche +1

We investigate deterministic identification over arbitrary memoryless channels under the constraint that the error probabilities of first and second kind are exponentially small in…

cs.IT2025

Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels

Pau Colomer, Christian Deppe, Holger Boche +1

In our previous work, we presented the \emph{Hypothesis Testing Lemma}, a key tool that establishes sufficient conditions for the existence of good deterministic identification (DI…