27 citations · 45 across the 13 of their papers we have counts for
22 papers · 1 filter
Common Randomness Generation from Sources with Infinite Polish Alphabet
Wafa Labidi, Rami Ezzine, Moritz Wiese +2
We investigate the problem of common randomness (CR) generation in the basic two-party communication setting in which a sender and a receiver aim to agree on a common random variab…
Deterministic -identification For Slow Fading Channel
Mohammad Javad Salariseddigh, Muris Spahovic, Christian Deppe
Deterministic -identification (DKI) is addressed for Gaussian channels with slow fading (GSF), where the transmitter is restricted to an average power constraint and channel sid…
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…
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…