PUB - Publikationen an der Universität Bielefeld

Alle markieren

• [41]
  

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

  H. Aydinian, et al., “A Combinatorial Model of Two-Sided Search”, INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, vol. 29, 2018, pp. 481-504.

  PUB | DOI | WoS
   
• [40]
  

  2016 | Zeitschriftenaufsatz | Angenommen | PUB-ID: 2903307

  H. Boche, et al., “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

  H. Aydinian, et al., “A Combinatorial Model of Two-Sided Search”, SOFSEM 2016: Theory and Practice of Computer Science, R.M. Freivalds, G. Engels, and B. Catania, eds., Lecture Notes in Computer Science, vol. 9587, Berlin: Springer, 2016, pp.148-160.

  PUB | DOI
   
• [38]
  

  2016 | Konferenzbeitrag | Angenommen | PUB-ID: 2903308

  H. Boche, et al., “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

  C. Deppe and V. Lebedev, “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

  A. Ahlswede, et al., eds., Hiding Data - Selected Topics: Rudolf Ahlswede’s Lectures on Information Theory 3, Foundations in Signal Processing, Communications and Networking, 1st ed., Heidelberg: Springer, 2016.

  PUB | DOI
   
• [35]
  

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

  H. Boche, M. Cai, and C. Deppe, “The broadcast classical–quantum capacity region of a two-phase bidirectional relaying channel”, Quantum Information Processing, vol. 14, 2015, pp. 3879-3897.

  PUB | DOI | WoS
   
• [34]
  

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

  A. Ahlswede, et al., eds., Transmitting and Gaining Data: Rudolf Ahlswede’s Lectures on Information Theory 2, Foundations in Signal Processing, Communications and Networking, 1st ed., Heidelberg: Springer, 2015.

  PUB | DOI
   
• [33]
  

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

  H. Boche, et al., “Secrecy capacities of compound quantum wiretap channels and applications”, Phys. Rev. A, vol. 89, 2014, : 052320.

  PUB | DOI | WoS
   
• [32]
  

  2014 | Preprint | PUB-ID: 2656557

  A. D'yachkov, et al., “Superimposed Codes and Threshold Group Testing”, 2014.

  PUB | arXiv
   
• [31]
  

  2014 | Preprint | PUB-ID: 2656562

  H. Boche, M. Cai, and C. Deppe, “Broadcast Classical-Quantum Capacity Region of Two-Phase Bidirectional Relaying Channel”, 2014.

  PUB | arXiv
   
• [30]
  

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

  A. Ahlswede, et al., eds., Storing and Transmitting Data: Rudolf Ahlswede’s Lectures on Information Theory 1, Foundations in Signal Processing, Communications and Networking, vol. 10, Berlin, Heidelberg: Springer, 2014.

  PUB | DOI
   
• [29]
  

  2013 | Preprint | PUB-ID: 2656553

  H. Boche, M. Cai, and C. Deppe, “Classical-Quantum Arbitrarily Varying Wiretap Channel - A Capacity Formula with Ahlswede Dichotomy - Resources”, 2013.

  PUB | arXiv
   
• [28]
  

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

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

  PUB | DOI
   
• [27]
  

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

  A. D’yachkov, et al., “Superimposed Codes and Threshold Group Testing”, Information Theory, Combinatorics, and Search Theory, H. Aydinian, F. Cicalese, and C. Deppe, eds., Lecture Notes in Computer Science, vol. 7777, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp.509-533.

  PUB | DOI
   
• [26]
  

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

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

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

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

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

  PUB | DOI
   
• [24]
  

  2013 | Preprint | PUB-ID: 2656548

  H. Boche, et al., “Secrecy capacities of compound quantum wiretap channels and applications”, 2013.

  PUB | arXiv
   
• [23]
  

  2013 | Konferenzbeitrag | PUB-ID: 2656539

  H. Aydinian, et al., “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

  C. Deppe and V.S. Lebedev, “Group testing problem with two defectives”, Problems of Information Transmission, vol. 49, 2013, pp. 375-381.

  PUB | DOI | WoS
   
• [21]
  

  2012 | Preprint | PUB-ID: 2656544

  M. Cai, N. Cai, and C. Deppe, “Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels”, 2012.

  PUB | arXiv
   
• [20]
  

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

  M. Cai, N. Cai, and C. Deppe, “Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels”, 2012 IEEE International Symposium on Information Theory Proceedings, Institute of Electrical and Electronics Engineers, ed., Piscataway, NJ: IEEE, 2012, pp.726-730.

  PUB | DOI
   
• [19]
  

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

  R. Ahlswede, C. Deppe, and V.S. Lebedev, “Finding one of D defective elements in some group testing models”, Problems of Information Transmission, vol. 48, 2012, pp. 173-181.

  PUB | DOI | WoS
   
• [18]
  

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

  R. Ahlswede, et al., “Two Batch Search With Lie Cost”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 55, 2009, pp. 1433-1439.

  PUB | DOI | WoS
   
• [17]
  

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

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

  PUB | Download (ext.)
   
• [16]
  

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

  R. Ahlswede, et al., “T-Shift synchronization codes”, Discrete Applied Mathematics, vol. 156, 2008, pp. 1461-1468.

  PUB | DOI | WoS
   
• [15]
  

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

  R. Ahlswede, F. Cicalese, and C. Deppe, “Searching with lies under error cost constraints”, Discrete Applied Mathematics, vol. 156, 2008, pp. 1444-1460.

  PUB | DOI | WoS
   
• [14]
  

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

  F. Cicalese and C. Deppe, “Perfect minimally adaptive q-ary search with unreliable tests”, JOURNAL OF STATISTICAL PLANNING AND INFERENCE, vol. 137, 2007, pp. 162-175.

  PUB | DOI | WoS
   
• [13]
  

  2007 | Sammelwerksbeitrag | PUB-ID: 1860115

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

  PUB | DOI
   
• [12]
  

  2006 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2449061

  R. Ahlswede, et al., eds., General theory of information transfer and combinatorics, Lecture notes in computer science, vol. 4123, Berlin: Springer, 2006.

  PUB
   
• [11]
  

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

  F. Cicalese and C. Deppe, “Q-ary Ulam-Rényi game with constrained lies”, General Theory of Information Transfer and Combinatorics, R. Ahlswede, et al., eds., Lecture notes in computer science, vol. 4123, Berlin, Heidelberg: Springer, 2006, pp.663-679.

  PUB | DOI
   
• [10]
  

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

  R. Ahlswede, et al., “Information Theoretic Models in Language Evolution”, General Theory of Information Transfer and Combinatorics, R. Ahlswede, et al., eds., Lecture Notes in Computer Science, vol. 4123, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp.769-787.

  PUB | DOI
   
• [9]
  

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

  R. Ahlswede, et al., “A Fast Suffix-Sorting Algorithm”, General Theory of Information Transfer and Combinatorics, R. Ahlswede, et al., eds., Lecture Notes in Computer Science, vol. 4123, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp.719-734.

  PUB | DOI
   
• [8]
  

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

  R. Ahlswede, F. Cicalese, and C. Deppe, “Searching with lies under error transition cost constraints”, Electronic Notes in Discrete Mathematics, vol. 21, 2005, pp. 173-179.

  PUB | DOI
   
• [7]
  

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

  C. Deppe and H. Schnettler, “On the 3/4-conjecture for fix-free codes”, DMTC Proceedings, Discrete Mathematics & Theoretical Computer Science, 2005, pp.111-116.

  PUB
   
• [6]
  

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

  R. Ahlswede, C. Deppe, and V. Lebedev, “Non-binary error correcting codes with noiseless feedback, localized errors, or both”, Annals of the European Academy of Sciences, vol. 1, 2005, pp. 285-309.

  PUB
   
• [5]
  

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

  C. Deppe, “Strategies for the Renyi-Ulam Game with fixed number of lies”, THEORETICAL COMPUTER SCIENCE, vol. 314, 2004, pp. 45-55.

  PUB | DOI | WoS
   
• [4]
  

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

  F. Cicalese, C. Deppe, and D. Mundici, “Q-ary Ulam-Renyi game with weighted constrained lies”, COMPUTING AND COMBINATORICS, PROCEEDINGS, vol. 3106, SPRINGER-VERLAG BERLIN, 2004, pp.82-91.

  PUB | WoS
   
• [3]
  

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

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

  PUB | WoS
   
• [2]
  

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

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

  PUB | DOI
   
• [1]
  

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

  C. Deppe, “Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes”, DISCRETE MATHEMATICS, vol. 224, 2000, pp. 79-98.

  PUB | DOI | WoS