36 citations · 269 across the 67 of their papers we have counts for
15 papers · 1 filter
Identification over Compound Multiple-Input Multiple-Output Broadcast Channels
Johannes Rosenberger, Uzi Pereg, Christian Deppe
The identification capacity region of the compound broadcast channel is determined under an average error criterion, where the sender has no channel state information. We give sing…
Communication with Unreliable Entanglement Assistance
Uzi Pereg, Christian Deppe, Holger Boche
Entanglement resources can increase transmission rates substantially. Unfortunately, entanglement is a fragile resource that is quickly degraded by decoherence effects. In order to…
The Quantum Multiple-Access Channel with Cribbing Encoders
Uzi Pereg, Christian Deppe, Holger Boche
Communication over a quantum multiple-access channel (MAC) with cribbing encoders is considered, whereby Transmitter 2 performs a measurement on a system that is entangled with Tra…
Integrating Quantum Simulation for Quantum-Enhanced Classical Network Emulation
Stephen DiAdamo, Janis Nötzel, Simon Sekavčnik +5
We describe a method of investigating the near-term potential of quantum communication technology for communication networks from the perspective of current networks. For this, we…
Classical State Masking over a Quantum Channel
Uzi Pereg, Christian Deppe, Holger Boche
Transmission of classical information over a quantum state-dependent channel is considered, when the encoder can measure channel side information (CSI) and is required to mask info…
Reed-Muller Identification
Mattia Spandri, Roberto Ferrara, Christian Deppe
Ahlswede and Dueck identification has the potential of exponentially reducing traffic or exponentially increasing rates in applications where a full decoding of the message is not…
Implementation and Experimental Evaluation of Reed-Solomon Identification
Roberto Ferrara, Luis Torres-Figueroa, Holger Boche +4
Identification is a communication paradigm that promises exponential advantages over transmission for applications that do not actually require all messages to be reliably transmit…
Deterministic Identification Over Poisson Channels
Mohammad J. Salariseddigh, Uzi Pereg, Holger Boche +2
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 scal…
The Computational and Latency Advantage of Quantum Communication Networks
Roberto Ferrara, Riccardo Bassoli, Christian Deppe +2
This article summarises the current status of classical communication networks and identifies some critical open research challenges that can only be solved by leveraging quantum t…
Outage Common Randomness Capacity Characterization of Multiple-Antenna Slow Fading Channels
Rami Ezzine, Moritz Wiese, Christian Deppe +1
We investigate the problem of common randomness (CR) generation from discrete correlated sources aided by one-way communication over single-user multiple-input multiple-output (MIM…
On the Semi-Decidability of Remote State Estimation and Stabilization via Noisy Communication Channels
Holger Boche, Yannik Böck, Christian Deppe
We consider the task of remote state estimation and stabilization of disturbed linear plants via noisy communication channels. In 2007 Matveev and Savkin established a surprising l…
Identification over Additive Noise Channels in the Presence of Feedback
Moritz Wiese, Wafa Labidi, Christian Deppe +1
We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power const…
Common Randomness Generation over Slow Fading Channels
Rami Ezzine, Moritz Wiese, Christian Deppe +1
This paper analyzes the problem of common randomness (CR) generation from correlated discrete sources aided by unidirectional communication over Single-Input Single-Output (SISO) s…
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects
Alexey Lebedev, Christian Deppe
In 1946, Koopman introduced a two-sided search model. In this model, a searched object is active and can move, at most, one step after each test. We analyze the model of a combinat…
Computability of the Channel Reliability Function and Related Bounds
Holger Boche, Christian Deppe
The channel reliability function is an important tool that characterizes the reliable transmission of messages over communication channels. For many channels, only upper and lower…