41 Publikationen
-
-
2016 | Zeitschriftenaufsatz | Angenommen | PUB-ID: 2903307Boche, H., Cai, M., Deppe, C., and Nötzel, J. (Accepted). Classical-Quantum Arbitrarily Varying Wiretap Channel - Ahlswede Dichotomy - Positivity - Resources - Super Activation. Quantum Information Processing.PUB
-
2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2903303Aydinian, H., Cicalese, F., Deppe, C., and Lebedev, V. (2016). “A Combinatorial Model of Two-Sided Search” in SOFSEM 2016: Theory and Practice of Computer Science, Freivalds, R. M., Engels, G., and Catania, B. eds. Lecture Notes in Computer Science, vol. 9587, (Berlin: Springer), 148-160.PUB | DOI
-
2016 | Konferenzbeitrag | Angenommen | PUB-ID: 2903308Boche, H., Cai, M., Deppe, C., and Nötzel, J. (Accepted). “Classical-Quantum Arbitrarily Varying Wiretap Channel: Common Randomness Assisted Code and Continuity” in IEEE International Symposium on Information Theory Proceedings (ISIT).PUB
-
2016 | Konferenzbeitrag | Eingereicht | PUB-ID: 2903310Deppe, C., and Lebedev, V. (Submitted). “Finding one of D defective elements in the additive group testing model” in ACCT 2016: Fifteenth International Workshop on Algebraic and Combinatorial Coding Theory.PUB
-
2016 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2903311Ahlswede, A., Althöfer, I., Deppe, C., and Tamm, U. eds. (2016). Hiding Data - Selected Topics: Rudolf Ahlswede’s Lectures on Information Theory 3. Foundations in Signal Processing, Communications and Networking, 1st ed. Heidelberg: Springer.PUB | DOI
-
-
2015 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2903313Ahlswede, A., Althöfer, I., Deppe, C., and Tamm, U. eds. (2015). Transmitting and Gaining Data: Rudolf Ahlswede’s Lectures on Information Theory 2. Foundations in Signal Processing, Communications and Networking, 1st ed. Heidelberg: Springer.PUB | DOI
-
-
-
-
2014 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2656596Ahlswede, A., Althöfer, I., Deppe, C., and Tamm, U. eds. (2014). Storing and Transmitting Data: Rudolf Ahlswede’s Lectures on Information Theory 1. Foundations in Signal Processing, Communications and Networking, 10, Berlin, Heidelberg: Springer.PUB | DOI
-
-
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656530Ahlswede, R., Deppe, C., and Lebedev, V. (2013). “Threshold and Majority Group Testing” in Information Theory, Combinatorics, and Search Theory, Aydinian, H., Cicalese, F., and Deppe, C. eds. Lecture Notes in Computer Science, vol. 7777, (Berlin, Heidelberg: Springer Berlin Heidelberg), 488-508.PUB | DOI
-
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656578D’yachkov, A., Rykov, V., Deppe, C., and Lebedev, V. (2013). “Superimposed Codes and Threshold Group Testing” in Information Theory, Combinatorics, and Search Theory, Aydinian, H., Cicalese, F., and Deppe, C. eds. Lecture Notes in Computer Science, vol. 7777, (Berlin, Heidelberg: Springer Berlin Heidelberg), 509-533.PUB | DOI
-
2013 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2612184Aydinian, H., Cicalese, F., and Deppe, C. eds. (2013). Information theory, Combinatoric and Search Theory: In Memory of Rudolf Ahlswede. Lecture Notes in Computer Science, 7777, Heidelberg: Springer Verlag.PUB | DOI | Download (ext.)
-
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656571Deppe, C., and Wischmann, C. (2013). “A Heuristic Solution of a Cutting Problem Using Hypergraphs” in Information Theory, Combinatorics, and Search Theory, Aydinian, H., Cicalese, F., and Deppe, C. eds. Lecture Notes in Computer Science, vol. 7777, (Berlin, Heidelberg: Springer Berlin Heidelberg), 658-676.PUB | DOI
-
-
2013 | Konferenzbeitrag | PUB-ID: 2656539Aydinian, H., Cicalese, F., Deppe, C., and Lebedev, V. (2013). “Optimal strategies for a model of combinatorial two-sided search” in Proceedings of Seventh International Workshop on Optimal Codes and Related Topics OC.PUB
-
-
-
2012 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2656566Cai, M., Cai, N., and Deppe, C. (2012). “Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels” in 2012 IEEE International Symposium on Information Theory Proceedings, Institute of Electrical and Electronics Engineers ed. (Piscataway, NJ: IEEE), 726-730.PUB | DOI
-
-
-
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1860114Deppe, C. (2008). “A survey of new results in coding with feedback and searching with lies” in Aspects of network and information security, Kranakis, E., Haroutunian, E. A., and Shahbazian, E. eds. NATO Science for Peace and Security Series - D: Information and Communication Security, vol. 17, (IOS Press: Amsterdam), 299-307.PUB | Download (ext.)
-
-
-
-
-
2006 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2449061Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., and Mashurian, H. eds. (2006). General theory of information transfer and combinatorics. Lecture notes in computer science, 4123, Berlin: Springer.PUB
-
2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2499624Cicalese, F., and Deppe, C. (2006). “Q-ary Ulam-Rényi game with constrained lies” in General Theory of Information Transfer and Combinatorics, Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., and Masurian, H. eds. Lecture notes in computer science, vol. 4123, (Berlin, Heidelberg: Springer), 663-679.PUB | DOI
-
2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656516Ahlswede, R., Arikan, E., Bäumer, L., and Deppe, C. (2006). “Information Theoretic Models in Language Evolution” in General Theory of Information Transfer and Combinatorics, Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., and Mashurian, H. eds. Lecture Notes in Computer Science, vol. 4123, (Berlin, Heidelberg: Springer Berlin Heidelberg), 769-787.PUB | DOI
-
2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656503Ahlswede, R., Balkenhol, B., Deppe, C., and Fröhlich, M. (2006). “A Fast Suffix-Sorting Algorithm” in General Theory of Information Transfer and Combinatorics, Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., and Mashurian, H. eds. Lecture Notes in Computer Science, vol. 4123, (Berlin, Heidelberg: Springer Berlin Heidelberg), 719-734.PUB | DOI
-
-
2005 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1860116Deppe, C., and Schnettler, H. (2005). “On the 3/4-conjecture for fix-free codes” in DMTC Proceedings Discrete Mathematics & Theoretical Computer Science 111-116.PUB
-
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913091Ahlswede, R., Deppe, C., and Lebedev, V. (2005). Non-binary error correcting codes with noiseless feedback, localized errors, or both. Annals of the European Academy of Sciences 1, 285-309.PUB
-
-
-
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1608945Cicalese, F., and Deppe, C. (2003). “Quasi-perfect minimally adaptive q-ary search with unreliable tests” in Algorithms and computation. 14th international symposium, proceedings Lecture Notes in Computer Science, vol. 2906, (Berlin: Springer), 527-536.PUB | WoS
-
-