Introduction
Rudolf Ahlswede Prom 60 to 66
Information Theory and Some Friendly Neighbors Ein Wunschkonzert
Probabilistic Models
1 Identification for Sources
2 On Identification
3 Identification and Prediction
4 Watermarking Identification Codes with Related Topics on Common Randomness
5 Notes on Conditions for Successive Refinement of Information
6 Coding for the Multiple-Access Adder Channel
7 Bounds of E-Capacity for Multiple-Access Channel with Random Parameter
8 Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint
9 Codes with the Identifiable Parent Property and the Multiple-Access Channel
Ⅱ Cryptology - Pseudo Random Sequences
10 Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder
11 A Simplified Method for Computing the Key Equivocation for Additive-Like Instantaneous Block Encipherers
12 Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer
13 Large Families of Pseudorandom Sequences of k Symbols and Their Complexity Part I
14 Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part II
15 On a Fast Version of a Pseudorandom Generator
16 On Pseudorandom Sequences and Their Application
17 Authorship Attribution of Texts: A Review
Ⅲ Quantum Models
18 Raum-Zeit und Quantenphysik Ein Geburtstagsstgndchen ffir Hans-Jiirgen Treder
19 Quantum Information Transfer from One System to Another One
20 On Rank Two Channels
21 Universal Sets of Quantum Information Processing Primitives and Their Optimal Use
Ⅴ Information Measures-Error Concepts-Peerformance Criteria
Ⅵ Search-Sorting-Ordering-Planning
Ⅶ Language Evolution-Praatern Discovry-Reconstructions
Ⅷ Network Coding
Ⅸ Combinatorial Models
Ⅹ Problem Section
Author Index
鄂公网安备 42010302001612号 