331 citations · 1.8k across the 125 of their papers we have counts for
16 papers · 2 filters
Deterministic Identification For MC ISI-Poisson Channel
Mohammad Javad Salariseddigh, Vahid Jamali, Uzi Pereg +3
Several applications of molecular communications (MC) feature an alarm-prompt behavior for which the prevalent Shannon capacity may not be the appropriate performance metric. The i…
Neuromorphic Twins for Networked Control and Decision-Making
Holger Boche, Yannik N. Böck, Christian Deppe +1
We consider the problem of remotely tracking the state of and unstable linear time-invariant plant by means of data transmitted through a noisy communication channel from an algori…
On the Need of Neuromorphic Twins to Detect Denial-of-Service Attacks on Communication Networks
Holger Boche, Rafael F. Schaefer, H. Vincent Poor +1
As we are more and more dependent on the communication technologies, resilience against any attacks on communication networks is important to guarantee the digital sovereignty of o…
Message Transmission and Common Randomness Generation over MIMO Slow Fading Channels with Arbitrary Channel State Distribution
Rami Ezzine, Moritz Wiese, Christian Deppe +1
We investigate the problem of message transmission and the problem of common randomness (CR) generation over single-user multiple-input multiple-output (MIMO) slow fading channels…
Common Randomness Generation from Sources with Countable Alphabet
Wafa Labidi, Rami Ezzine, Christian Deppe +2
We study a standard two-source model for common randomness (CR) generation in which Alice and Bob generate a common random variable with high probability of agreement by observing…
On the Need of Analog Signals and Systems for Digital-Twin Representations
Holger Boche, Ullrich J. Mönich, Yannik N. Böck +1
We consider the task of converting different digital descriptions of analog bandlimited signals and systems into each other, with a rigorous application of mathematical computabili…
A Single-Letter Capacity Formula for MIMO Gauss-Markov Rayleigh Fading Channels
Rami Ezzine, Moritz Wiese, Christian Deppe +1
Over the past decades, the problem of communication over finite-state Markov channels (FSMCs) has been investigated in many researches and the capacity of FSMCs has been studied in…
On non-detectability of non-computability and the degree of non-computability of solutions of circuit and wave equations on digital computers
Holger Boche, Volker Pohl
It is known that there exist mathematical problems of practical relevance which cannot be computed on a Turing machine. An important example is the calculation of the first derivat…
Secure and Private Source Coding with Private Key and Decoder Side Information
Onur Günlü, Rafael F. Schaefer, Holger Boche +1
The problem of secure source coding with multiple terminals is extended by considering a remote source whose noisy measurements are the correlated random variables used for secure…
A General Formula for Uniform Common Randomness Capacity
Rami Ezzine, Moritz Wiese, Christian Deppe +1
We generalize the uniform common randomness capacity formula, initially established by Ahslwede and Csiszár for a two-source model for common randomness generation from independent…
Deterministic Identification for Molecular Communications over the Poisson Channel
Mohammad Javad Salariseddigh, Uzi Pereg, Holger Boche +3
Various applications of molecular communications (MC) are event-triggered, and, as a consequence, the prevalent Shannon capacity may not be the right measure for performance assess…
Mosaics of Combinatorial Designs for Semantic Security on Quantum Wiretap Channels
Holger Boche, Minglai Cai, Moritz Wiese
We study semantic security for classical-quantum channels. Our security functions are functional forms of mosaics of combinatorial designs. We extend methods for classical channels…
On the Arithmetic Complexity of the Bandwidth of Bandlimited Signals
Holger Boche, Yannik N. Böck, Ullrich J. Mönich
The bandwidth of a signal is an important physical property that is of relevance in many signal- and information-theoretic applications. In this paper we study questions related to…
Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties
Andrea Grigorescu, Holger Boche, Rafael F. Schaefer +1
The capacity of finite state channels (FSCs) with feedback has been shown to be a limit of a sequence of multi-letter expressions. Despite many efforts, a closed-form single-letter…
Common Randomness Generation from Gaussian Sources
Wafa Labidi, Rami Ezzine, Christian Deppe +1
We study the problem of common randomness (CR) generation in the basic two-party communication setting in which the sender and the receiver aim to agree on a common random variable…
A Rigorous Proof of the Capacity of MIMO Gauss-Markov Rayleigh Fading Channels
Rami Ezzine, Moritz Wiese, Christian Deppe +1
We investigate the problem of message transmission over time-varying single-user multiple-input multiple-output (MIMO) Rayleigh fading channels with average power constraint and wi…