Diploma thesis and Phd-thesis
Block Coding for the Binary Symmetric Channel with Noiseless Feedback -- or Binary Sequential Search with
Errors,
Diplomarbeit, Universität Bielefeld, 1996.
Solution of Ulam's Searching Game with Three Lies or an Optimal Adaptive Strategy for Binary
Three-Error-Correcting-Codes,
Dissertation, Universität Bielefeld, 1998.
Preprints SFB 343
98-036 Christian Deppe
Solution of Ulam's Searching Game with Three Lies
or an Optimal Adaptive Strategy for Binary
Three-Error-Correcting-Codes
00-115 R. Ahlswede, N. Cai, C. Deppe
Codes with Unequal Error Protection with Feedback
E01-001 C. Deppe
Searching with lies and coding with feedback
-
- 1
- R. Ahlswede, E. Arikan, L. Bäumer, and C. Deppe,
Information theoretic models in language evolution,
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Springer Verlag,
Vol. 4123, 769-787, 2006.
- 2
- R. Ahlswede, B. Balkenhol, C. Deppe, and M. Fröhlich,
A fast suffix-sorting algorithm,
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Springer Verlag,
Vol. 4123, 719-734, 2006.
- 3
- R. Ahlswede, B. Balkenhol, C. Deppe, H. Mashurian, and T. Partner,
Shift synchronization codes, General Theory of Information Transfer and Combinatorics,
Special Issue of Discrete Applied Mathematics, Vol. 156, No. 9, 1461-1468, 2008.
- 4
- R. Ahlswede, N. Cai, and C. Deppe,
An isoperimetric theorem for sequences generated by feedback and feedback-codes
for unequal error protection,
Problems of Information Transmission 37, 4, 332-338, 2001.
- 5
- R. Ahlswede, F. Cicalese, and C. Deppe,
Searching with lies under error transition cost constraints,
General Theory of Information Transfer and Combinatorics,
Special Issue of Discrete Applied Mathematics, Vol. 156, No. 9, 1444-1460, 2008.
- 6
- R. Ahlswede, F. Cicalese, C. Deppe, and U. Vaccaro,
Two Batch Search with weighted lies, IEEE Trans. on Inf. Trans., Vol. 55, No. 4, 1433-1439, 2009.
- 7
- R. Ahlswede, C. Deppe, and V. Lebedev,
Non-binary error correcting codes with noiseless feedback, localized errors, or both,
Annals of the European Academy of Sciences, No. 1, 285-309, 2005.
- 8
- R. Ahlswede, C. Deppe, and V. Lebedev,
Threshold and majority group testing,
Lecture Notes in Computer Science, Vol. 7777, Springer Verlag, 488-508, 2013.
- 9
- R. Ahlswede, C. Deppe, and V. Lebedev,
Majority group testing with density tests,
ISIT 2011.
- 10
- R. Ahlswede, C. Deppe, and V. Lebedev,
Finding one of defective elements in some group testing models,
Probl. Peredachi Inf., Vol. 48, No. 2, 100–109, 2012.
- 11
- H. Boche, M. Cai, and C. Deppe,
Secrecy capacities of compound quantum wiretap channels and applications,
Phys. Rev. A 89, 052320, 2014.
- 12
- H. Boche, M. Cai, and C. Deppe,
Classical-Quantum Arbitrarily Varying Wiretap Channel - A Capacity Formula with Ahlswede Dichotomy - Resources,
arXiv:1307.8007, submitted.
- 13
- H. Boche, M. Cai, and C. Deppe,
Broadcast Classical-Quantum Capacity Region of Two-Phase Bidirectional Relaying Channel,
arXiv:1401.3682, submitted.
- 14
- Minglai Cai, Ning Cai, and Christian Deppe,
Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels,
submitted.
- 15
- F. Cicalese and C. Deppe,
Quasi-perfect minimally adaptive q-ary search with unreliable tests,
Algorithms and Computation, Lecture Notes in Computer Science, Vol. 2906, Springer Verlag, 527 - 536, 2003.
- 16
- F. Cicalese and C. Deppe,
Perfect Minimally Adaptive q-ary Search with Unreliable Tests,
Journal of Statistical Planning and Inference, Vol. 137, No. 1, 162-175, 2006.
- 17
- F. Cicalese and C. Deppe,
Q-ary Ulam-Renyi game with constrained lies,
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Springer Verlag,
Vol. 4123, 678-694, 2006.
- 18
- F. Cicalese, C. Deppe, and D. Mundici,
Q-ary Ulam-Rényi game with weighted constrained lies
Proceedings of 10th Annual International Conference on Computing and Combinatorics- COCOON'2004,
Lecture Notes in Computer Science, Vol. 3106, 82-91, 2004.
- 19
- C. Deppe,
Solution of Ulam's searching game with three lies
or an optimal adaptive strategy for binary three-error-correcting-codes,
Discrete Math. 224, No. 1-3, 79-98, 2000.
- 20
- C. Deppe,
Strategies for the fixed Renyi-Ulam Game with fixed number of lies,
Theoretical Computer Science 314, 45-55, 2004.
- 21
- C. Deppe,
Searching with lies and coding with feedback,
Entropy, Search, Complexity, Bolyai Society Mathematical Studies, Katona (Ed.), Vol. 16, 27-70, 2007.
- 22
- C. Deppe,
A survey of new results in coding with feedback and searching with lies,
Information and Communication Security, IOS Press, Series D, Vol. 17, 299 - 307, 2008.
- 23
- C. Deppe, A. Dyachkov, V. Rykov, and V. Lebedev,
Superimposed Codes and Threshold Group Testing,
Ahlswede Festschrift,
Lecture Notes in Computer Science, Vol. 7777, Springer Verlag, 509-533, 2013.
- 24
- C. Deppe and V. Lebedev,
Group testing problem with two defectives,
Problems of Information Transmission, Vol. 49, No. 4, 375–381, 2013.
- 25
- C. Deppe and H. Schnettler,
On the 3/4-conjecture for fix-free codes,
European Conference on Combinatorics, Graph Theory and Applications, editor: S. Felsner,
DMTCS Proceedings Volume AE, 111-116, 2005.
- 26
- C. Deppe and C. Wischmann,
A heuristic solution of a cutting
problem using hypergraphs,
Ahlswede Festschrift,
Lecture Notes in Computer Science, Vol. 7777, Springer Verlag, 658-676, 2013.
Main Site
For any questions and problems with this web site please email to
cdeppe@Mathematik.Uni-Bielefeld.DE.
Last change: 01/02/2015