41 Publikationen

Alle markieren

  • [41]
    2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2930283
    Aydinian, H., Cicalese, F., Deppe, C., and Lebedev, V. (2018). A Combinatorial Model of Two-Sided Search. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 29, 481-504.
    PUB | DOI | WoS
     
  • [40]
    2016 | Zeitschriftenaufsatz | Angenommen | PUB-ID: 2903307
    Boche, 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
     
  • [39]
    2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2903303
    Aydinian, 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
     
  • [38]
    2016 | Konferenzbeitrag | Angenommen | PUB-ID: 2903308
    Boche, 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
     
  • [37]
    2016 | Konferenzbeitrag | Eingereicht | PUB-ID: 2903310
    Deppe, 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
     
  • [36]
    2016 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2903311
    Ahlswede, 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
     
  • [35]
    2015 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2903306
    Boche, H., Cai, M., and Deppe, C. (2015). The broadcast classical–quantum capacity region of a two-phase bidirectional relaying channel. Quantum Information Processing 14, 3879-3897.
    PUB | DOI | WoS
     
  • [34]
    2015 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2903313
    Ahlswede, 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
     
  • [33]
    2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2903305
    Boche, H., Cai, M., Cai, N., and Deppe, C. (2014). Secrecy capacities of compound quantum wiretap channels and applications. Phys. Rev. A 89:052320.
    PUB | DOI | WoS
     
  • [32]
    2014 | Preprint | PUB-ID: 2656557
    D'yachkov, A., Rykov, V., Deppe, C., and Lebedev, V. (2014). Superimposed Codes and Threshold Group Testing.
    PUB | arXiv
     
  • [31]
    2014 | Preprint | PUB-ID: 2656562
    Boche, H., Cai, M., and 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., 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
     
  • [29]
    2013 | Preprint | PUB-ID: 2656553
    Boche, H., Cai, M., and 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., 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
     
  • [27]
    2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656578
    D’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
     
  • [26]
    2013 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2612184
    Aydinian, 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.)
     
  • [25]
    2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656571
    Deppe, 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
     
  • [24]
    2013 | Preprint | PUB-ID: 2656548
    Boche, H., Cai, M., Cai, N., and 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., 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
     
  • [22]
    2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2660934
    Deppe, C., and Lebedev, V. S. (2013). Group testing problem with two defectives. Problems of Information Transmission 49, 375-381.
    PUB | DOI | WoS
     
  • [21]
    2012 | Preprint | PUB-ID: 2656544
    Cai, M., Cai, N., and 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., 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
     
  • [19]
    2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2518066
    Ahlswede, R., Deppe, C., and Lebedev, V. S. (2012). Finding one of D defective elements in some group testing models. Problems of Information Transmission 48, 173-181.
    PUB | DOI | WoS
     
  • [18]
    2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1634814
    Ahlswede, R., Cicalese, F., Deppe, C., and Vaccaro, U. (2009). Two Batch Search With Lie Cost. IEEE TRANSACTIONS ON INFORMATION THEORY 55, 1433-1439.
    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 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.)
     
  • [16]
    2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1860133
    Ahlswede, R., Balkenhol, B., Deppe, C., Mashuriyan, H., and Partner, T. (2008). T-Shift synchronization codes. Discrete Applied Mathematics 156, 1461-1468.
    PUB | DOI | WoS
     
  • [15]
    2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587893
    Ahlswede, R., Cicalese, F., and Deppe, C. (2008). Searching with lies under error cost constraints. Discrete Applied Mathematics 156, 1444-1460.
    PUB | DOI | WoS
     
  • [14]
    2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597509
    Cicalese, F., and Deppe, C. (2007). Perfect minimally adaptive q-ary search with unreliable tests. JOURNAL OF STATISTICAL PLANNING AND INFERENCE 137, 162-175.
    PUB | DOI | WoS
     
  • [13]
    2007 | Sammelwerksbeitrag | PUB-ID: 1860115
    Deppe, C. (2007). “Coding with Feedback and Searching with Lies” in Entropy, search, complexity, Csiszár, I., Katona, G., and Tardos, G. eds. Bolyai Society mathematical studies, vol. 16, (Berlin: Springer), 27-70.
    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., and 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., 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
     
  • [10]
    2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656516
    Ahlswede, 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
     
  • [9]
    2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656503
    Ahlswede, 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
     
  • [8]
    2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2308668
    Ahlswede, R., Cicalese, F., and Deppe, C. (2005). Searching with lies under error transition cost constraints. Electronic Notes in Discrete Mathematics 21, 173-179.
    PUB | DOI
     
  • [7]
    2005 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1860116
    Deppe, 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
     
  • [6]
    2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913091
    Ahlswede, 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
     
  • [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, 45-55.
    PUB | DOI | WoS
     
  • [4]
    2004 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1606534
    Cicalese, F., Deppe, C., and Mundici, D. (2004). “Q-ary Ulam-Renyi game with weighted constrained lies” in COMPUTING AND COMBINATORICS, PROCEEDINGS, vol. 3106, (SPRINGER-VERLAG BERLIN), 82-91.
    PUB | WoS
     
  • [3]
    2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1608945
    Cicalese, 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
     
  • [2]
    2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883973
    Ahlswede, R., Cai, N., and Deppe, C. (2001). An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection. Problems of Information Transmission 37, 332-338.
    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, 79-98.
    PUB | DOI | WoS
     

Suche

Publikationen filtern

Darstellung / Sortierung

Export / Einbettung