Book Volume 7777 2013

Information Theory, Combinatorics, and Search Theory

In Memory of Rudolf Ahlswede

Editors:

ISBN: 978-3-642-36898-1 (Print) 978-3-642-36899-8 (Online)

Table of contents (36 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Information Theory

    1. No Access

      Chapter

      Pages 1-10

      Two New Results for Identification for Sources

    2. No Access

      Chapter

      Pages 11-43

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

    3. No Access

      Chapter

      Pages 44-70

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

    4. No Access

      Chapter

      Pages 71-122

      Strong Secrecy for Multiple Access Channels

    5. No Access

      Chapter

      Pages 123-144

      Capacity Results for Arbitrarily Varying Wiretap Channels

    6. No Access

      Chapter

      Pages 145-166

      On Oblivious Transfer Capacity

    7. No Access

      Chapter

      Pages 167-208

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

    8. No Access

      Chapter

      Pages 209-216

      Uniformly Generating Origin Destination Tables

    9. No Access

      Chapter

      Pages 217-233

      Identification via Quantum Channels

    10. No Access

      Chapter

      Pages 234-246

      Classical-Quantum Arbitrarily Varying Wiretap Channel

    11. No Access

      Chapter

      Pages 247-283

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

    12. No Access

      Chapter

      Pages 284-297

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

    13. No Access

      Chapter

      Pages 298-312

      How to Read a Randomly Mixed Up Message

    14. No Access

      Chapter

      Pages 313-345

      Multiple Objects: Error Exponents in Hypotheses Testing and Identification

  3. Combinatorics

    1. No Access

      Chapter

      Pages 346-363

      Family Complexity and VC-Dimension

    2. No Access

      Chapter

      Pages 364-370

      The Restricted Word Shadow Problem

    3. No Access

      Chapter

      Pages 371-401

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

    4. No Access

      Chapter

      Pages 402-418

      Generic Algorithms for Factoring Strings

    5. No Access

      Chapter

      Pages 419-431

      On Data Recovery in Distributed Databases

    6. No Access

      Chapter

      Pages 432-450

      An Unstable Hypergraph Problem with a Unique Optimal Solution

previous Page of 2