Skip to main content
SpringerLink
Log in
Book cover

Information Theory, Combinatorics, and Search Theory

In Memory of Rudolf Ahlswede

  • Book
  • © 2013

Overview

Editors:
  1. Harout Aydinian

    1. Department of Mathematics, University of Bielefeld, Bielefeld, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ferdinando Cicalese

    1. Department of Computer Science, University of Salerno, Fisciano, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Christian Deppe

    1. Department of Mathematics, University of Bielefeld, Bielefeld, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Provides a comprehensive picture of the vision Rudolf Ahlswede had and put forward of a broad and systematic theory of search
  • One third of the papers originated in framework of the ZiF cooperation group "Search Methodologies"
  • Includes obituaries and several stories and anecdotes to Rudolf Ahlswede's life

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 7777)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (36 chapters)

  1. Front Matter

    Download chapter PDF

  2. Information Theory

    1. Two New Results for Identification for Sources

      • Christian Heup
      Pages 1-10

    2. L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order

      • Christian Heup
      Pages 11-43

    3. Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme

      • Binyue Liu, Ning Cai
      Pages 44-70

    4. Strong Secrecy for Multiple Access Channels

      • Moritz Wiese, Holger Boche
      Pages 71-122

    5. Capacity Results for Arbitrarily Varying Wiretap Channels

      • Igor Bjelaković, Holger Boche, Jochen Sommerfeld
      Pages 123-144

    6. On Oblivious Transfer Capacity

      • Rudolf Ahlswede, Imre Csiszár
      Pages 145-166

    7. Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay

      • Anas Chaaban, Aydin Sezgin, Daniela Tuninetti
      Pages 167-208

    8. Uniformly Generating Origin Destination Tables

      • David M. Einstein, Lee K. Jones
      Pages 209-216

    9. Identification via Quantum Channels

      • Andreas Winter
      Pages 217-233

    10. Classical-Quantum Arbitrarily Varying Wiretap Channel

      • Vladimir Blinovsky, Minglai Cai
      Pages 234-246

    11. Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities

      • Igor Bjelaković, Holger Boche, Gisbert Janßen, Janis Nötzel
      Pages 247-283

    12. On the Value of Multiple Read/Write Streams for Data Compression

      • Travis Gagie
      Pages 284-297

    13. How to Read a Randomly Mixed Up Message

      • Matthias Löwe
      Pages 298-312

    14. Multiple Objects: Error Exponents in Hypotheses Testing and Identification

      • Evgueni Haroutunian, Parandzem Hakobyan
      Pages 313-345

  3. Combinatorics

    1. Family Complexity and VC-Dimension

      • Christian Mauduit, András Sárközy
      Pages 346-363

    2. The Restricted Word Shadow Problem

      • Rudolf Ahlswede, Vladimir Lebedev
      Pages 364-370

    3. Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals

      • Harout Aydinian, Éva Czabarka, László A. Székely
      Pages 371-401

    4. Generic Algorithms for Factoring Strings

      • David E. Daykin, Jacqueline W. Daykin, Costas S. Iliopoulos, W. F. Smyth
      Pages 402-418

    5. On Data Recovery in Distributed Databases

      • Sergei L. Bezrukov, Uwe Leck, Victor P. Piotrowski
      Pages 419-431
Back to top

Keywords

About this book

This volume is dedicated to the memory of Rudolf Ahlswede, who passed away in December 2010. The Festschrift contains 36 thoroughly refereed research papers from a memorial symposium, which took place in July 2011.

The four macro-topics of this workshop: theory of games and strategic planning; combinatorial group testing and database mining; computational biology and string matching; information coding and spreading and patrolling on networks; provide a comprehensive picture of the vision Rudolf Ahlswede put forward of a broad and systematic theory of search.

Editors and Affiliations

  • Department of Mathematics, University of Bielefeld, Bielefeld, Germany

    Harout Aydinian, Christian Deppe

  • Department of Computer Science, University of Salerno, Fisciano, Italy

    Ferdinando Cicalese

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation