Christian Deppe
Christian Deppe
Verified email at tum.de - Homepage
Title
Cited by
Cited by
Year
General theory of information transfer and combinatorics
R Ahlswede, L Bäumer, N Cai, H Aydinian, V Blinovsky, C Deppe, ...
Springer, 2006
442006
Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
C Deppe
Discrete Mathematics 224 (1-3), 79-98, 2000
392000
Coding with feedback and searching with lies
C Deppe
Entropy, Search, Complexity, 27-70, 2007
312007
Secure identification for wiretap channels; robustness, super-additivity and continuity
H Boche, C Deppe
IEEE Transactions on Information Forensics and Security 13 (7), 1641-1655, 2018
242018
Secure identification under passive eavesdroppers and active jamming attacks
H Boche, C Deppe
IEEE Transactions on Information Forensics and Security 14 (2), 472-485, 2018
232018
Information theory, combinatorics, and search theory
H Aydinian, F Cicalese, C Deppe
Springer-Verlag Berlin Heidelberg, 2013
222013
Searching with lies under error cost constraints
R Ahlswede, F Cicalese, C Deppe
Discrete applied mathematics 156 (9), 1444-1460, 2008
212008
Superimposed codes and threshold group testing
A D’yachkov, V Rykov, C Deppe, V Lebedev
Information theory, combinatorics, and search theory, 509-533, 2013
202013
Non-binary error correcting codes with noiseless feedback, localized errors, or both
R Ahlswede, C Deppe, V Lebedev
2006 IEEE International Symposium on Information Theory, 2486-2487, 2006
202006
Q-Ary Ulam-Rényi Game with Weighted Constrained Lies
F Cicalese, C Deppe, D Mundici
International Computing and Combinatorics Conference, 82-91, 2004
202004
Secrecy capacities of compound quantum wiretap channels and applications
H Boche, M Cai, N Cai, C Deppe
Physical Review A 89 (5), 052320, 2014
142014
Two batch search with lie cost
R Ahlswede, F Cicalese, C Deppe, U Vaccaro
IEEE transactions on information theory 55 (4), 1433-1439, 2009
142009
Searching with lies and coding with feedback
C Deppe
Entropy, Search, Complexity, Bolyai Society Mathematical Studies, Katona (Ed …, 2007
142007
Quasi-perfect minimally adaptive q-ary search with unreliable tests
F Cicalese, C Deppe
International Symposium on Algorithms and Computation, 527-536, 2003
132003
Strategies for the Renyi–Ulam Game with fixed number of lies
C Deppe
Theoretical computer science 314 (1-2), 45-55, 2004
122004
Secure and robust identification via classical-quantum channels
H Boche, C Deppe, A Winter
IEEE Transactions on Information Theory 65 (10), 6734-6749, 2019
112019
Classical-quantum arbitrarily varying wiretap channel: Secret message transmission under jamming attacks
H Boche, M Cai, C Deppe, J Nötzel
Journal of Mathematical Physics 58 (10), 102203, 2017
112017
Classical-quantum arbitrarily varying wiretap channel: Common randomness assisted code and continuity
H Boche, M Cai, C Deppe, J Nötzel
Quantum Information Processing 16 (1), 35, 2017
112017
Threshold and majority group testing
R Ahlswede, C Deppe, V Lebedev
Information Theory, Combinatorics, and Search Theory, 488-508, 2013
102013
Bounds for threshold and majority group testing
R Ahlswede, C Deppe, V Lebedev
2011 IEEE International Symposium on Information Theory Proceedings, 69-73, 2011
92011
The system can't perform the operation now. Try again later.
Articles 1–20