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




Papers



 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.



 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.



 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.



 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.



 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.



 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.



 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.





 R. Ahlswede, C. Deppe, and V. Lebedev,
Threshold and majority group testing,
Discrete Applied Mathematics.




 R. Ahlswede, C. Deppe, and V. Lebedev,
Majority group testing with density tests, 
ISIT 2011.




 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.



 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.



 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.



 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.



 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.



 C. Deppe,
Strategies for the fixed Renyi-Ulam Game with fixed number of lies,
Theoretical Computer Science 314, 45-55, 2004.



 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.


Surveys:



 C. Deppe,
Searching with lies and coding with feedback,
Entropy, Search, Complexity, Bolyai Society Mathematical Studies, Katona (Ed.), Vol. 16, 27-70, 2007.



 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.





 Main Site


 



For any questions and problems with this web site please email to
cdeppe@Mathematik.Uni-Bielefeld.DE. 
Last change: 01/03/2009