41 Publikationen
-
-
2016 | Zeitschriftenaufsatz | Angenommen | PUB-ID: 2903307Boche, H., Cai, M., Deppe, C., & Nötzel, J. (Accepted). Classical-Quantum Arbitrarily Varying Wiretap Channel - Ahlswede Dichotomy - Positivity - Resources - Super Activation. Quantum Information ProcessingPUB
-
2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2903303Aydinian, H., Cicalese, F., Deppe, C., & Lebedev, V. (2016). A Combinatorial Model of Two-Sided Search. In R. M. Freivalds, G. Engels, & B. Catania (Eds.), Lecture Notes in Computer Science: Vol. 9587. SOFSEM 2016: Theory and Practice of Computer Science (pp. 148-160). Berlin: Springer. doi:10.1007/978-3-662-49192-8_12PUB | DOI
-
2016 | Konferenzbeitrag | Angenommen | PUB-ID: 2903308Boche, H., Cai, M., Deppe, C., & Nötzel, J. (Accepted). Classical-Quantum Arbitrarily Varying Wiretap Channel: Common Randomness Assisted Code and Continuity. IEEE International Symposium on Information Theory Proceedings (ISIT)PUB
-
2016 | Konferenzbeitrag | Eingereicht | PUB-ID: 2903310Deppe, C., & Lebedev, V. (Submitted). Finding one of D defective elements in the additive group testing model. ACCT 2016: Fifteenth International Workshop on Algebraic and Combinatorial Coding TheoryPUB
-
2016 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2903311Ahlswede A., Althöfer I., Deppe C., & 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. doi:10.1007/978-3-319-31515-7PUB | DOI
-
-
2015 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2903313Ahlswede A., Althöfer I., Deppe C., & 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. doi:10.1007/978-3-319-12523-7PUB | DOI
-
-
-
-
2014 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2656596Ahlswede A., Althöfer I., Deppe C., & 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. doi:10.1007/978-3-319-05479-7PUB | DOI
-
-
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656530Ahlswede, R., Deppe, C., & Lebedev, V. (2013). Threshold and Majority Group Testing. In H. Aydinian, F. Cicalese, & C. Deppe (Eds.), Lecture Notes in Computer Science: Vol. 7777. Information Theory, Combinatorics, and Search Theory (pp. 488-508). Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/978-3-642-36899-8_24PUB | DOI
-
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656578D’yachkov, A., Rykov, V., Deppe, C., & Lebedev, V. (2013). Superimposed Codes and Threshold Group Testing. In H. Aydinian, F. Cicalese, & C. Deppe (Eds.), Lecture Notes in Computer Science: Vol. 7777. Information Theory, Combinatorics, and Search Theory (pp. 509-533). Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/978-3-642-36899-8_25PUB | DOI
-
2013 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2612184Aydinian H., Cicalese F., & Deppe C. (Eds.) (2013). Information theory, Combinatoric and Search Theory: In Memory of Rudolf Ahlswede (Lecture Notes in Computer Science, 7777). Heidelberg: Springer Verlag. doi:10.1007/978-3-642-36899-8PUB | DOI | Download (ext.)
-
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656571Deppe, C., & Wischmann, C. (2013). A Heuristic Solution of a Cutting Problem Using Hypergraphs. In H. Aydinian, F. Cicalese, & C. Deppe (Eds.), Lecture Notes in Computer Science: Vol. 7777. Information Theory, Combinatorics, and Search Theory (pp. 658-676). Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/978-3-642-36899-8_33PUB | DOI
-
-
2013 | Konferenzbeitrag | PUB-ID: 2656539Aydinian, H., Cicalese, F., Deppe, C., & Lebedev, V. (2013). Optimal strategies for a model of combinatorial two-sided search. Proceedings of Seventh International Workshop on Optimal Codes and Related Topics OCPUB
-
-
-
2012 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2656566Cai, M., Cai, N., & Deppe, C. (2012). Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels. In Institute of Electrical and Electronics Engineers (Ed.), 2012 IEEE International Symposium on Information Theory Proceedings (pp. 726-730). Piscataway, NJ: IEEE. doi:10.1109/ISIT.2012.6284548PUB | DOI
-
-
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1634814Ahlswede, R., Cicalese, F., Deppe, C., & Vaccaro, U. (2009). Two Batch Search With Lie Cost. IEEE TRANSACTIONS ON INFORMATION THEORY, 55(4), 1433-1439. https://doi.org/10.1109/TIT.2009.2013014PUB | DOI | WoS
-
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1860114Deppe, C. (2008). A survey of new results in coding with feedback and searching with lies. In E. Kranakis, E. A. Haroutunian, & E. Shahbazian (Eds.), NATO Science for Peace and Security Series - D: Information and Communication Security: Vol. 17. Aspects of network and information security (pp. 299-307). IOS Press: Amsterdam.PUB | Download (ext.)
-
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1860133Ahlswede, R., Balkenhol, B., Deppe, C., Mashuriyan, H., & Partner, T. (2008). T-Shift synchronization codes. Discrete Applied Mathematics, 156(9), 1461-1468. https://doi.org/10.1016/j.dam.2007.06.020PUB | DOI | WoS
-
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587893Ahlswede, R., Cicalese, F., & Deppe, C. (2008). Searching with lies under error cost constraints. Discrete Applied Mathematics, 156(9), 1444-1460. https://doi.org/10.1016/j.dam.2007.04.033PUB | DOI | WoS
-
2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597509Cicalese, F., & Deppe, C. (2007). Perfect minimally adaptive q-ary search with unreliable tests. JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 137(1), 162-175. https://doi.org/10.1016/j.jspi.2005.10.005PUB | DOI | WoS
-
2007 | Sammelwerksbeitrag | PUB-ID: 1860115Deppe, C. (2007). Coding with Feedback and Searching with Lies. In I. Csiszár, G. Katona, & G. Tardos (Eds.), Bolyai Society mathematical studies: Vol. 16. Entropy, search, complexity (pp. 27-70). Berlin: Springer. https://doi.org/10.1007/978-3-540-32777-6_2PUB | DOI
-
2006 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2449061Ahlswede R., Bäumer L., Cai N., Aydinian H., Blinovsky V., Deppe C., & 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., & Deppe, C. (2006). Q-ary Ulam-Rényi game with constrained lies. In R. Ahlswede, L. Bäumer, N. Cai, H. Aydinian, V. Blinovsky, C. Deppe, & H. Masurian (Eds.), Lecture notes in computer science: Vol. 4123. General Theory of Information Transfer and Combinatorics (pp. 663-679). Berlin, Heidelberg: Springer. doi:10.1007/11889342_42PUB | DOI
-
2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656516Ahlswede, R., Arikan, E., Bäumer, L., & Deppe, C. (2006). Information Theoretic Models in Language Evolution. In R. Ahlswede, L. Bäumer, N. Cai, H. Aydinian, V. Blinovsky, C. Deppe, & H. Mashurian (Eds.), Lecture Notes in Computer Science: Vol. 4123. General Theory of Information Transfer and Combinatorics (pp. 769-787). Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/11889342_49PUB | DOI
-
2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656503Ahlswede, R., Balkenhol, B., Deppe, C., & Fröhlich, M. (2006). A Fast Suffix-Sorting Algorithm. In R. Ahlswede, L. Bäumer, N. Cai, H. Aydinian, V. Blinovsky, C. Deppe, & H. Mashurian (Eds.), Lecture Notes in Computer Science: Vol. 4123. General Theory of Information Transfer and Combinatorics (pp. 719-734). Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/11889342_46PUB | DOI
-
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2308668Ahlswede, R., Cicalese, F., & Deppe, C. (2005). Searching with lies under error transition cost constraints. Electronic Notes in Discrete Mathematics, 21, 173-179. https://doi.org/10.1016/j.endm.2005.07.018PUB | DOI
-
2005 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1860116Deppe, C., & Schnettler, H. (2005). On the 3/4-conjecture for fix-free codes. DMTC Proceedings, Discrete Mathematics & Theoretical Computer Science, 111-116.PUB
-
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913091Ahlswede, R., Deppe, C., & 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
-
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1608581Deppe, C. (2004). Strategies for the Renyi-Ulam Game with fixed number of lies. THEORETICAL COMPUTER SCIENCE, 314(1-2), 45-55. https://doi.org/10.1016/j.tcs.2003.10.036PUB | DOI | WoS
-
-
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1608945Cicalese, F., & Deppe, C. (2003). Quasi-perfect minimally adaptive q-ary search with unreliable tests. Algorithms and computation. 14th international symposium, proceedings, Lecture Notes in Computer Science, 2906, 527-536. Berlin: Springer.PUB | WoS
-
2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883973Ahlswede, R., Cai, N., & Deppe, C. (2001). An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection. Problems of Information Transmission, 37(4), 332-338. https://doi.org/10.1023/A:1013823417501PUB | DOI
-
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1618979Deppe, C. (2000). Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes. DISCRETE MATHEMATICS, 224(1-3), 79-98. https://doi.org/10.1016/S0012-365X(00)00109-6PUB | DOI | WoS