General Theory of Information Transfer and Combinatorics

ISBN: 978-3-540-46244-6 (Print) 978-3-540-46245-3 (Online)

Table of contents (82 chapters)

previous Page of 5
  1. Front Matter

    Pages -

  2. Introduction

    1. No Access

      Book Chapter

      Pages 1-44

      Introduction

    2. No Access

      Book Chapter

      Pages 45-48

      Rudolf Ahlswede — From 60 to 66

    3. No Access

      Book Chapter

      Pages 49-50

      Information Theory and Some Friendly Neighbors – Ein Wunschkonzert

  3. Probabilistic Models

    1. No Access

      Book Chapter

      Pages 51-61

      Identification for Sources

    2. No Access

      Book Chapter

      Pages 62-83

      On Identification

    3. No Access

      Book Chapter

      Pages 84-106

      Identification and Prediction

    4. No Access

      Book Chapter

      Pages 107-153

      Watermarking Identification Codes with Related Topics on Common Randomness

    5. No Access

      Book Chapter

      Pages 154-164

      Notes on Conditions for Successive Refinement of Information

    6. No Access

      Book Chapter

      Pages 165-195

      Coding for the Multiple-Access Adder Channel

    7. No Access

      Book Chapter

      Pages 196-217

      Bounds of E-Capacity for Multiple-Access Channel with Random Parameter

    8. No Access

      Book Chapter

      Pages 218-248

      Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint

    9. No Access

      Book Chapter

      Pages 249-257

      Codes with the Identifiable Parent Property and the Multiple-Access Channel

  4. Cryptology – Pseudo Random Sequences

    1. No Access

      Book Chapter

      Pages 258-275

      Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder

    2. No Access

      Book Chapter

      Pages 276-284

      A Simplified Method for Computing the Key Equivocation for Additive-Like Instantaneous Block Encipherers

    3. No Access

      Book Chapter

      Pages 285-292

      Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer

    4. No Access

      Book Chapter

      Pages 293-307

      Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I

    5. No Access

      Book Chapter

      Pages 308-325

      Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II

    6. No Access

      Book Chapter

      Pages 326-342

      On a Fast Version of a Pseudorandom Generator

    7. No Access

      Book Chapter

      Pages 343-361

      On Pseudorandom Sequences and Their Application

    8. No Access

      Book Chapter

      Pages 362-380

      Authorship Attribution of Texts: A Review

previous Page of 5