41 Publikationen

Alle markieren

  • [41]
    2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2930283
    Aydinian, H., Cicalese, F., Deppe, C., & Lebedev, V. (2018). A Combinatorial Model of Two-Sided Search. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 29(4), 481-504. doi:10.1142/S0129054118410022
    PUB | DOI | WoS
     
  • [40]
    2016 | Zeitschriftenaufsatz | Angenommen | PUB-ID: 2903307
    Boche, H., Cai, M., Deppe, C., & Nötzel, J. (Accepted). Classical-Quantum Arbitrarily Varying Wiretap Channel - Ahlswede Dichotomy - Positivity - Resources - Super Activation. Quantum Information Processing
    PUB
     
  • [39]
    2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2903303
    Aydinian, 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_12
    PUB | DOI
     
  • [38]
    2016 | Konferenzbeitrag | Angenommen | PUB-ID: 2903308
    Boche, 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
     
  • [37]
    2016 | Konferenzbeitrag | Eingereicht | PUB-ID: 2903310
    Deppe, 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 Theory
    PUB
     
  • [36]
    2016 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2903311
    Ahlswede 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-7
    PUB | DOI
     
  • [35]
    2015 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2903306
    Boche, H., Cai, M., & Deppe, C. (2015). The broadcast classical–quantum capacity region of a two-phase bidirectional relaying channel. Quantum Information Processing, 14(10), 3879-3897. doi:10.1007/s11128-015-1065-2
    PUB | DOI | WoS
     
  • [34]
    2015 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2903313
    Ahlswede 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-7
    PUB | DOI
     
  • [33]
    2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2903305
    Boche, H., Cai, M., Cai, N., & Deppe, C. (2014). Secrecy capacities of compound quantum wiretap channels and applications. Phys. Rev. A, 89(5), 052320. doi:10.1103/physreva.89.052320
    PUB | DOI | WoS
     
  • [32]
    2014 | Preprint | PUB-ID: 2656557
    D'yachkov, A., Rykov, V., Deppe, C., & Lebedev, V. (2014). Superimposed Codes and Threshold Group Testing
    PUB | arXiv
     
  • [31]
    2014 | Preprint | PUB-ID: 2656562
    Boche, H., Cai, M., & Deppe, C. (2014). Broadcast Classical-Quantum Capacity Region of Two-Phase Bidirectional Relaying Channel
    PUB | arXiv
     
  • [30]
    2014 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2656596
    Ahlswede 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-7
    PUB | DOI
     
  • [29]
    2013 | Preprint | PUB-ID: 2656553
    Boche, H., Cai, M., & Deppe, C. (2013). Classical-Quantum Arbitrarily Varying Wiretap Channel - A Capacity Formula with Ahlswede Dichotomy - Resources
    PUB | arXiv
     
  • [28]
    2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656530
    Ahlswede, 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_24
    PUB | DOI
     
  • [27]
    2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656578
    D’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_25
    PUB | DOI
     
  • [26]
    2013 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2612184
    Aydinian 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-8
    PUB | DOI | Download (ext.)
     
  • [25]
    2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656571
    Deppe, 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_33
    PUB | DOI
     
  • [24]
    2013 | Preprint | PUB-ID: 2656548
    Boche, H., Cai, M., Cai, N., & Deppe, C. (2013). Secrecy capacities of compound quantum wiretap channels and applications
    PUB | arXiv
     
  • [23]
    2013 | Konferenzbeitrag | PUB-ID: 2656539
    Aydinian, 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 OC
    PUB
     
  • [22]
    2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2660934
    Deppe, C., & Lebedev, V. S. (2013). Group testing problem with two defectives. Problems of Information Transmission, 49(4), 375-381. doi:10.1134/S0032946013040078
    PUB | DOI | WoS
     
  • [21]
    2012 | Preprint | PUB-ID: 2656544
    Cai, M., Cai, N., & Deppe, C. (2012). Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels
    PUB | arXiv
     
  • [20]
    2012 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2656566
    Cai, 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.6284548
    PUB | DOI
     
  • [19]
    2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2518066
    Ahlswede, R., Deppe, C., & Lebedev, V. S. (2012). Finding one of D defective elements in some group testing models. Problems of Information Transmission, 48(2), 173-181. doi:10.1134/S0032946012020068
    PUB | DOI | WoS
     
  • [18]
    2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1634814
    Ahlswede, 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.2013014
    PUB | DOI | WoS
     
  • [17]
    2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1860114
    Deppe, 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.)
     
  • [16]
    2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1860133
    Ahlswede, 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.020
    PUB | DOI | WoS
     
  • [15]
    2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587893
    Ahlswede, 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.033
    PUB | DOI | WoS
     
  • [14]
    2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597509
    Cicalese, 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.005
    PUB | DOI | WoS
     
  • [13]
    2007 | Sammelwerksbeitrag | PUB-ID: 1860115
    Deppe, 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_2
    PUB | DOI
     
  • [12]
    2006 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2449061
    Ahlswede 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
     
  • [11]
    2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2499624
    Cicalese, 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_42
    PUB | DOI
     
  • [10]
    2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656516
    Ahlswede, 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_49
    PUB | DOI
     
  • [9]
    2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656503
    Ahlswede, 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_46
    PUB | DOI
     
  • [8]
    2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2308668
    Ahlswede, 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.018
    PUB | DOI
     
  • [7]
    2005 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1860116
    Deppe, C., & Schnettler, H. (2005). On the 3/4-conjecture for fix-free codes. DMTC Proceedings, Discrete Mathematics & Theoretical Computer Science, 111-116.
    PUB
     
  • [6]
    2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913091
    Ahlswede, 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
     
  • [5]
    2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1608581
    Deppe, 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.036
    PUB | DOI | WoS
     
  • [4]
    2004 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1606534
    Cicalese, F., Deppe, C., & Mundici, D. (2004). Q-ary Ulam-Renyi game with weighted constrained lies. COMPUTING AND COMBINATORICS, PROCEEDINGS, 3106, 82-91. SPRINGER-VERLAG BERLIN.
    PUB | WoS
     
  • [3]
    2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1608945
    Cicalese, 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
     
  • [2]
    2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883973
    Ahlswede, 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:1013823417501
    PUB | DOI
     
  • [1]
    2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1618979
    Deppe, 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-6
    PUB | DOI | WoS
     

Suche

Publikationen filtern

Darstellung / Sortierung

Export / Einbettung