Christian Deppe

Orcid: 0000-0002-2265-4887

Affiliations:
  • Technical University of Munich, Germany


According to our database1, Christian Deppe authored at least 118 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Deterministic K-Identification for Future Communication Networks: The Binary Symmetric Channel Results.
Future Internet, March, 2024

Message Transmission and Common Randomness Generation Over MIMO Slow Fading Channels With Arbitrary Channel State Distribution.
IEEE Trans. Inf. Theory, January, 2024

Deterministic K-Identification for MC Poisson Channel With Inter-Symbol Interference.
IEEE Open J. Commun. Soc., 2024

Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates.
CoRR, 2024

Zero-entropy encoders and simultaneous decoders in identification via quantum channels.
CoRR, 2024

Common Randomness Generation from Finite Compound Sources.
CoRR, 2024

2023
Deterministic Identification for Molecular Communications Over the Poisson Channel.
IEEE Trans. Mol. Biol. Multi Scale Commun., December, 2023

Message Identification for Task-Oriented Communications: Exploiting an Exponential Increase in the Number of Connected Devices.
IEEE Internet Things Mag., December, 2023

Identification Over Additive Noise Channels in the Presence of Feedback.
IEEE Trans. Inf. Theory, November, 2023

A Proof of a Single-Letter Capacity Formula for MIMO Gauss-Markov Rayleigh Fading Channels.
IEEE Trans. Inf. Theory, November, 2023

Identification over quantum broadcast channels.
Quantum Inf. Process., October, 2023

Quantum and Quantum-Inspired Stereographic K Nearest-Neighbour Clustering.
Entropy, September, 2023

Identification Over Compound Multiple-Input Multiple-Output Broadcast Channels.
IEEE Trans. Inf. Theory, July, 2023

Communication With Unreliable Entanglement Assistance.
IEEE Trans. Inf. Theory, July, 2023

On the Semidecidability of the Remote State Estimation Problem.
IEEE Trans. Autom. Control., March, 2023

Information-theoretical analysis of event-triggered molecular communication.
CoRR, 2023

Information-Theoretically Secret Reed-Muller Identification with Affine Designs.
CoRR, 2023

Correcting one error in channels with feedback.
CoRR, 2023

Deterministic K-Identification For Slow Fading Channels.
Proceedings of the IEEE Information Theory Workshop, 2023

Deterministic Identification for MC Binomial Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Deterministic Identification Over Multiple-Access Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Capacity Bounds for Identification With Effective Secrecy.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Joint Identification and Sensing for Discrete Memoryless Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2023

A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Deterministic Identification for MC ISI-Poisson Channel.
Proceedings of the IEEE International Conference on Communications, 2023

Common Randomness Generation from Sources with Countable Alphabet.
Proceedings of the IEEE International Conference on Communications, 2023

The Multiple- Access Channel with Entangled and Conferencing Transmitters.
Proceedings of the IEEE Globecom Workshops 2023, 2023

The Multiple-Access Channel with Entangled Transmitters.
Proceedings of the IEEE Global Communications Conference, 2023

Testing of Hybrid Quantum-Classical K-Means for Nonlinear Noise Mitigation.
Proceedings of the IEEE Global Communications Conference, 2023

Deterministic K-Identification for Binary Symmetric Channel.
Proceedings of the IEEE Global Communications Conference, 2023

Quantum Satellite Communications.
Proceedings of the A Roadmap to Future Space Connectivity, 2023

2022
Deterministic Identification Over Channels With Power Constraints.
IEEE Trans. Inf. Theory, 2022

The Quantum Multiple-Access Channel With Cribbing Encoders.
IEEE Trans. Inf. Theory, 2022

Coding With Noiseless Feedback Over the Z-Channel.
IEEE Trans. Inf. Theory, 2022

Correcting a Single Error in Feedback Channels.
Probl. Inf. Transm., 2022

Deterministic $K$-identification For Slow Fading Channel.
CoRR, 2022

Neuromorphic Twins for Networked Control and Decision-Making.
CoRR, 2022

A Single-Letter Capacity Formula for MIMO Gauss-Markov Rayleigh Fading Channels.
CoRR, 2022

Identification based on random coding.
CoRR, 2022

Non-adaptive and two-stage coding over the Z-channel.
CoRR, 2022

A General Formula for Uniform Common Randomness Capacity.
Proceedings of the IEEE Information Theory Workshop, 2022

The Quantum MAC with Cribbing Encoders.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Common Randomness Generation from Gaussian Sources.
Proceedings of the IEEE International Symposium on Information Theory, 2022

A Rigorous Proof of the Capacity of MIMO Gauss-Markov Rayleigh Fading Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Computability of the Channel Reliability Function and Related Bounds<sup>1</sup>.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Identification over Compound MIMO Broadcast Channels.
Proceedings of the IEEE International Conference on Communications, 2022

Deciding the Problem of Remote State Estimation via Noisy Communication Channels on Real Number Signal Processing Hardware.
Proceedings of the IEEE International Conference on Communications, 2022

Comparison of Quantum PUF models.
Proceedings of the IEEE Globecom 2022 Workshops, 2022

2021
Quantum Channel State Masking.
IEEE Trans. Inf. Theory, 2021

Bounds for the capacity error function for unidirectional channels with noiseless feedback.
Theor. Comput. Sci., 2021

Integrating Quantum Simulation for Quantum-Enhanced Classical Network Emulation.
IEEE Commun. Lett., 2021

Algorithms for q-ary error-correcting codes with limited magnitude and feedback.
Discret. Math., 2021

Classical State Masking over a Quantum Channel.
CoRR, 2021

Reed-Muller Identification.
CoRR, 2021

Practical implementation of identification codes.
CoRR, 2021

Computability of the Channel Reliability Function and Related Bounds.
CoRR, 2021

The Computational and Latency Advantage of Quantum Communication Networks.
IEEE Commun. Mag., 2021

Identification for Multi-Antenna Gaussian Channels.
Proceedings of the 25th International ITG Workshop on Smart Antennas, 2021

Identification under Effective Secrecy.
Proceedings of the IEEE Information Theory Workshop, 2021

Outage Common Randomness Capacity Characterization of Multiple-Antenna Slow Fading Channels.
Proceedings of the IEEE Information Theory Workshop, 2021

Computability of the Zero-Error Capacity of Noisy Channels.
Proceedings of the IEEE Information Theory Workshop, 2021

Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Non-Adaptive and Adaptive Two-Sided Search with Fast Objects.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Identification over the Gaussian Channel in the Presence of Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Common Randomness Generation over Slow Fading Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Deterministic Identification Over Poisson Channels.
Proceedings of the IEEE Globecom 2021 Workshops, Madrid, Spain, December 7-11, 2021, 2021

On the Semi-Decidability of Remote State Estimation and Stabilization via Noisy Communication Channels.
Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

Quantum Communication Networks, 1
23, Springer, ISBN: 978-3-030-62937-3, 2021

2020
Performance Analysis of Identification Codes.
Entropy, 2020

On the Effectiveness of Fekete's Lemma.
CoRR, 2020

Deterministic Identification Over Fading Channels.
Proceedings of the IEEE Information Theory Workshop, 2020

On the Effectiveness of Fekete's Lemma in Information Theory.
Proceedings of the IEEE Information Theory Workshop, 2020

Computability of the Zero-Error Capacity with Kolmogorov Oracle.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Semantic Security for Quantum Wiretap Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Secure Identification for Gaussian Channels.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Common Randomness Generation and Identification over Gaussian Channels.
Proceedings of the IEEE Global Communications Conference, 2020

How to apply the rubber method for channels with feedback.
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019
Secure and Robust Identification via Classical-Quantum Channels.
IEEE Trans. Inf. Theory, 2019

Secure Identification Under Passive Eavesdroppers and Active Jamming Attacks.
IEEE Trans. Inf. Forensics Secur., 2019

Secure Storage for Identification; Random Resources and Privacy Leakage.
IEEE Trans. Inf. Forensics Secur., 2019

Algorithms for Q-ary Error-Correcting Codes with Partial Feedback and Limited Magnitude.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Secure Identification for Wiretap Channels; Robustness, Super-Additivity and Continuity.
IEEE Trans. Inf. Forensics Secur., 2018

A Combinatorial Model of Two-Sided Search.
Int. J. Found. Comput. Sci., 2018

Secure Storage for Identification.
Proceedings of the 19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2018

Secret Message Transmission over Quantum Channels under Adversarial Quantum Noise: Secrecy Capacity and Super-activations.
Proceedings of the IEEE Information Theory Workshop, 2018

Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity Dichotomy.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity.
Quantum Inf. Process., 2017

Secret Message Transmission over Quantum Channels under Adversarial Quantum Noise: Secrecy Capacity and Super-Activation.
CoRR, 2017

Secure identification under jamming attacks.
Proceedings of the 2017 IEEE Workshop on Information Forensics and Security, 2017

Robust and secure identification.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Classical-quantum arbitrarily varying wiretap channel: Secret message transmission under jamming attacks.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Classical-quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation.
Quantum Inf. Process., 2016

2015
The broadcast classical-quantum capacity region of a two-phase bidirectional relaying channel.
Quantum Inf. Process., 2015

2014
Classical-quantum arbitrarily varying wiretap channel - A capacity formula with Ahlswede Dichotomy - Resources.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Group testing problem with two defectives.
Probl. Inf. Transm., 2013

Secrecy capacities of compound quantum wiretap channels and applications
CoRR, 2013

Superimposed Codes and Threshold Group Testing.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

A Heuristic Solution of a Cutting Problem Using Hypergraphs.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Threshold and Majority Group Testing.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012
Finding one of <i>D</i> defective elements in some group testing models.
Probl. Inf. Transm., 2012

Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Majority group testing with density tests.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Bounds for threshold and majority group testing.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2009
Two Batch Search With Lie Cost.
IEEE Trans. Inf. Theory, 2009

2008
Searching with lies under error cost constraints.
Discret. Appl. Math., 2008

2006
On q-ary fix-free codes and directed deBrujin graphs.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Non--binary error correcting codes with noiseless feedback, localized errors, or both.
Proceedings of the Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05., 2006

2005
Q-ary Ulam-Rényi game with constrained lies.
Electron. Notes Discret. Math., 2005

Searching with lies under error transition cost constraints.
Electron. Notes Discret. Math., 2005

T-shift synchronization codes.
Electron. Notes Discret. Math., 2005

A Fast Suffix-Sorting Algorithm.
Electron. Notes Discret. Math., 2005

Information theoretic models in language evolution.
Electron. Notes Discret. Math., 2005

2004
Strategies for the Renyi-Ulam Game with fixed number of lies.
Theor. Comput. Sci., 2004

Language evolution and information theory.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Q-Ary Ulam-Rényi Game with Weighted Constrained Lies.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2001
An Isoperimetric Theorem for Sequences Generated by Feedback and Feedback-Codes for Unequal Error Protection.
Probl. Inf. Transm., 2001

2000
Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes.
Discret. Math., 2000


  Loading...