PUB - Publikationen an der Universität Bielefeld

Alle markieren

• [41]
  

  2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2930283

  Aydinian, H., Cicalese, F., Deppe, C., Lebedev, V.: A Combinatorial Model of Two-Sided Search. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. 29, 481-504 (2018).

  PUB | DOI | WoS
   
• [40]
  

  2016 | Zeitschriftenaufsatz | Angenommen | PUB-ID: 2903307

  Boche, H., Cai, M., Deppe, C., Nötzel, J.: Classical-Quantum Arbitrarily Varying Wiretap Channel - Ahlswede Dichotomy - Positivity - Resources - Super Activation. Quantum Information Processing. (Accepted).

  PUB
   
• [39]
  

  2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2903303

  Aydinian, H., Cicalese, F., Deppe, C., Lebedev, V.: A Combinatorial Model of Two-Sided Search. In: Freivalds, R.M., Engels, G., and Catania, B. (eds.) SOFSEM 2016: Theory and Practice of Computer Science. Lecture Notes in Computer Science. 9587, p. 148-160. Springer, Berlin (2016).

  PUB | DOI
   
• [38]
  

  2016 | Konferenzbeitrag | Angenommen | PUB-ID: 2903308

  Boche, H., Cai, M., Deppe, C., Nötzel, J.: Classical-Quantum Arbitrarily Varying Wiretap Channel: Common Randomness Assisted Code and Continuity. IEEE International Symposium on Information Theory Proceedings (ISIT). (Accepted).

  PUB
   
• [37]
  

  2016 | Konferenzbeitrag | Eingereicht | PUB-ID: 2903310

  Deppe, C., Lebedev, V.: Finding one of D defective elements in the additive group testing model. ACCT 2016: Fifteenth International Workshop on Algebraic and Combinatorial Coding Theory. (Submitted).

  PUB
   
• [36]
  

  2016 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2903311

  Ahlswede, A., Althöfer, I., Deppe, C., Tamm, U. eds: Hiding Data - Selected Topics: Rudolf Ahlswede’s Lectures on Information Theory 3. Foundations in Signal Processing, Communications and Networking, 1st ed. Springer, Heidelberg (2016).

  PUB | DOI
   
• [35]
  

  2015 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2903306

  Boche, H., Cai, M., Deppe, C.: The broadcast classical–quantum capacity region of a two-phase bidirectional relaying channel. Quantum Information Processing. 14, 3879-3897 (2015).

  PUB | DOI | WoS
   
• [34]
  

  2015 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2903313

  Ahlswede, A., Althöfer, I., Deppe, C., Tamm, U. eds: Transmitting and Gaining Data: Rudolf Ahlswede’s Lectures on Information Theory 2. Foundations in Signal Processing, Communications and Networking, 1st ed. Springer, Heidelberg (2015).

  PUB | DOI
   
• [33]
  

  2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2903305

  Boche, H., Cai, M., Cai, N., Deppe, C.: Secrecy capacities of compound quantum wiretap channels and applications. Phys. Rev. A. 89, : 052320 (2014).

  PUB | DOI | WoS
   
• [32]
  

  2014 | Preprint | PUB-ID: 2656557

  D'yachkov, A., Rykov, V., Deppe, C., Lebedev, V.: Superimposed Codes and Threshold Group Testing. (2014).

  PUB | arXiv
   
• [31]
  

  2014 | Preprint | PUB-ID: 2656562

  Boche, H., Cai, M., Deppe, C.: Broadcast Classical-Quantum Capacity Region of Two-Phase Bidirectional Relaying Channel. (2014).

  PUB | arXiv
   
• [30]
  

  2014 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2656596

  Ahlswede, A., Althöfer, I., Deppe, C., Tamm, U. eds: Storing and Transmitting Data: Rudolf Ahlswede’s Lectures on Information Theory 1. Foundations in Signal Processing, Communications and Networking, 10. Springer, Berlin, Heidelberg (2014).

  PUB | DOI
   
• [29]
  

  2013 | Preprint | PUB-ID: 2656553

  Boche, H., Cai, M., Deppe, C.: Classical-Quantum Arbitrarily Varying Wiretap Channel - A Capacity Formula with Ahlswede Dichotomy - Resources. (2013).

  PUB | arXiv
   
• [28]
  

  2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656530

  Ahlswede, R., Deppe, C., Lebedev, V.: Threshold and Majority Group Testing. In: Aydinian, H., Cicalese, F., and Deppe, C. (eds.) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science. 7777, p. 488-508. Springer Berlin Heidelberg, Berlin, Heidelberg (2013).

  PUB | DOI
   
• [27]
  

  2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656578

  D’yachkov, A., Rykov, V., Deppe, C., Lebedev, V.: Superimposed Codes and Threshold Group Testing. In: Aydinian, H., Cicalese, F., and Deppe, C. (eds.) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science. 7777, p. 509-533. Springer Berlin Heidelberg, Berlin, Heidelberg (2013).

  PUB | DOI
   
• [26]
  

  2013 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2612184

  Aydinian, H., Cicalese, F., Deppe, C. eds: Information theory, Combinatoric and Search Theory: In Memory of Rudolf Ahlswede. Lecture Notes in Computer Science, 7777. Springer Verlag, Heidelberg (2013).

  PUB | DOI | Download (ext.)
   
• [25]
  

  2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656571

  Deppe, C., Wischmann, C.: A Heuristic Solution of a Cutting Problem Using Hypergraphs. In: Aydinian, H., Cicalese, F., and Deppe, C. (eds.) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science. 7777, p. 658-676. Springer Berlin Heidelberg, Berlin, Heidelberg (2013).

  PUB | DOI
   
• [24]
  

  2013 | Preprint | PUB-ID: 2656548

  Boche, H., Cai, M., Cai, N., Deppe, C.: Secrecy capacities of compound quantum wiretap channels and applications. (2013).

  PUB | arXiv
   
• [23]
  

  2013 | Konferenzbeitrag | PUB-ID: 2656539

  Aydinian, H., Cicalese, F., Deppe, C., Lebedev, V.: Optimal strategies for a model of combinatorial two-sided search. Proceedings of Seventh International Workshop on Optimal Codes and Related Topics OC. (2013).

  PUB
   
• [22]
  

  2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2660934

  Deppe, C., Lebedev, V.S.: Group testing problem with two defectives. Problems of Information Transmission. 49, 375-381 (2013).

  PUB | DOI | WoS
   
• [21]
  

  2012 | Preprint | PUB-ID: 2656544

  Cai, M., Cai, N., Deppe, C.: Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels. (2012).

  PUB | arXiv
   
• [20]
  

  2012 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2656566

  Cai, M., Cai, N., Deppe, C.: 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. p. 726-730. IEEE, Piscataway, NJ (2012).

  PUB | DOI
   
• [19]
  

  2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2518066

  Ahlswede, R., Deppe, C., Lebedev, V.S.: Finding one of D defective elements in some group testing models. Problems of Information Transmission. 48, 173-181 (2012).

  PUB | DOI | WoS
   
• [18]
  

  2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1634814

  Ahlswede, R., Cicalese, F., Deppe, C., Vaccaro, U.: Two Batch Search With Lie Cost. IEEE TRANSACTIONS ON INFORMATION THEORY. 55, 1433-1439 (2009).

  PUB | DOI | WoS
   
• [17]
  

  2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1860114

  Deppe, C.: A survey of new results in coding with feedback and searching with lies. In: Kranakis, E., Haroutunian, E.A., and Shahbazian, E. (eds.) Aspects of network and information security. NATO Science for Peace and Security Series - D: Information and Communication Security. 17, p. 299-307. Amsterdam, IOS Press (2008).

  PUB | Download (ext.)
   
• [16]
  

  2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1860133

  Ahlswede, R., Balkenhol, B., Deppe, C., Mashuriyan, H., Partner, T.: T-Shift synchronization codes. Discrete Applied Mathematics. 156, 1461-1468 (2008).

  PUB | DOI | WoS
   
• [15]
  

  2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587893

  Ahlswede, R., Cicalese, F., Deppe, C.: Searching with lies under error cost constraints. Discrete Applied Mathematics. 156, 1444-1460 (2008).

  PUB | DOI | WoS
   
• [14]
  

  2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597509

  Cicalese, F., Deppe, C.: Perfect minimally adaptive q-ary search with unreliable tests. JOURNAL OF STATISTICAL PLANNING AND INFERENCE. 137, 162-175 (2007).

  PUB | DOI | WoS
   
• [13]
  

  2007 | Sammelwerksbeitrag | PUB-ID: 1860115

  Deppe, C.: Coding with Feedback and Searching with Lies. In: Csiszár, I., Katona, G., and Tardos, G. (eds.) Entropy, search, complexity. Bolyai Society mathematical studies. 16, p. 27-70. Springer, Berlin (2007).

  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: General theory of information transfer and combinatorics. Lecture notes in computer science, 4123. Springer, Berlin (2006).

  PUB
   
• [11]
  

  2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2499624

  Cicalese, F., Deppe, C.: Q-ary Ulam-Rényi game with constrained lies. In: Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., and Masurian, H. (eds.) General Theory of Information Transfer and Combinatorics. Lecture notes in computer science. 4123, p. 663-679. Springer, Berlin, Heidelberg (2006).

  PUB | DOI
   
• [10]
  

  2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656516

  Ahlswede, R., Arikan, E., Bäumer, L., Deppe, C.: Information Theoretic Models in Language Evolution. In: Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., and Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science. 4123, p. 769-787. Springer Berlin Heidelberg, Berlin, Heidelberg (2006).

  PUB | DOI
   
• [9]
  

  2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656503

  Ahlswede, R., Balkenhol, B., Deppe, C., Fröhlich, M.: A Fast Suffix-Sorting Algorithm. In: Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., and Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science. 4123, p. 719-734. Springer Berlin Heidelberg, Berlin, Heidelberg (2006).

  PUB | DOI
   
• [8]
  

  2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2308668

  Ahlswede, R., Cicalese, F., Deppe, C.: Searching with lies under error transition cost constraints. Electronic Notes in Discrete Mathematics. 21, 173-179 (2005).

  PUB | DOI
   
• [7]
  

  2005 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1860116

  Deppe, C., Schnettler, H.: On the 3/4-conjecture for fix-free codes. DMTC Proceedings. Discrete Mathematics & Theoretical Computer Science. p. 111-116. (2005).

  PUB
   
• [6]
  

  2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913091

  Ahlswede, R., Deppe, C., Lebedev, V.: Non-binary error correcting codes with noiseless feedback, localized errors, or both. Annals of the European Academy of Sciences. 1, 285-309 (2005).

  PUB
   
• [5]
  

  2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1608581

  Deppe, C.: Strategies for the Renyi-Ulam Game with fixed number of lies. THEORETICAL COMPUTER SCIENCE. 314, 45-55 (2004).

  PUB | DOI | WoS
   
• [4]
  

  2004 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1606534

  Cicalese, F., Deppe, C., Mundici, D.: Q-ary Ulam-Renyi game with weighted constrained lies. COMPUTING AND COMBINATORICS, PROCEEDINGS. 3106, p. 82-91. SPRINGER-VERLAG BERLIN (2004).

  PUB | WoS
   
• [3]
  

  2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1608945

  Cicalese, F., Deppe, C.: Quasi-perfect minimally adaptive q-ary search with unreliable tests. Algorithms and computation. 14th international symposium, proceedings. Lecture Notes in Computer Science. 2906, p. 527-536. Springer, Berlin (2003).

  PUB | WoS
   
• [2]
  

  2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883973

  Ahlswede, R., Cai, N., Deppe, C.: An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection. Problems of Information Transmission. 37, 332-338 (2001).

  PUB | DOI
   
• [1]
  

  2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1618979

  Deppe, C.: 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 (2000).

  PUB | DOI | WoS