A new direction in extremal theory
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Journal of combinatorics, information and system sciences, Jg. 19 H. 3, S. 269-2801994Rich colorings with local constraints
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Journal of combinatorics, information & system sciences, Jg. 17 H. 3, S. 203-2161992A recursive bound for the number of complete K-subgraphs of a graph
Ahlswede, Rudolf ; Cai, Ning ; Zhang, Zhen ; Bodendiek, Rainer (Hrsg.) ; Henn, Rudolf (Hrsg.)1990Common randomness in information theory and cryptography. Part I: secret sharing
Ahlswede, Rudolf ; Csiszár, ImreIn: IEEE transactions on information theory, Jg. 39 H. 4, S. 1121-11321993Hypothesis testing with communication constraints
Ahlswede, Rudolf ; Csiszár, ImreIn: IEEE transactions on information theory, Jg. 32 H. 4, S. 533-5421986To get a bit of information may be as hard as to get full information
Ahlswede, Rudolf ; Csiszár, ImreIn: IEEE transactions on information theory, Jg. 27 H. 4, S. 398-4081981An inequality for the weights of two families of sets, their unions and intersections
Ahlswede, Rudolf ; Daykin, David E.In: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 43 H. 3, S. 183-1851978Inequalities for a pair of maps S x S -> S with S a finite set
Ahlswede, Rudolf ; Daykin, David E.In: Mathematische Zeitschrift, Jg. 165 H. 3, S. 267-2891979Integral inequalities for increasing functions
Ahlswede, Rudolf ; Daykin, David E.In: Mathematical Proceedings of the Cambridge Philosophical Society, Jg. 86 H. 03, S. 391-3941979The number of values of combinatorial functions
Ahlswede, Rudolf ; Daykin, David E.In: Bulletin of the London Mathematical Society, Jg. 11 H. 1, S. 49-511979Bad codes are good ciphers
Ahlswede, Rudolf ; Dueck, GunterIn: Problems of Control and Information Theory, Jg. 11 H. 5, S. 337-3511982Every bad code has a good subcode: a local converse to the coding theorem
Ahlswede, Rudolf ; Dueck, GunterIn: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 34 H. 2, S. 179-1821976Good codes can be produced by a few permutations
Ahlswede, Rudolf ; Dueck, GunterIn: IEEE transactions on information theory, Jg. 28 H. 3, S. 430-4431982Identification in the presence of feedback: a discovery of new capacity formulas
Ahlswede, Rudolf ; Dueck, GunterIn: IEEE transactions on information theory, Jg. 35 H. 1, S. 30-361989Identification via channels
Ahlswede, Rudolf ; Dueck, GunterIn: IEEE transactions on information theory, Jg. 35 H. 1, S. 15-291989A two-family extremal problem in hamming space
Ahlswede, Rudolf ; El Gamal, Abbas ; Pang, King F.In: Discrete Mathematics, Jg. 49 H. 1, S. 1-51984Bounds on algebraic code capacities for noisy channels. I
Ahlswede, Rudolf ; Gemma, J.In: Information and Control, Jg. 18 H. 2, S. 124-1451971Bounds on algebraic code capacities for noisy channels. II
Ahlswede, Rudolf ; Gemma, J.In: Information and Control, Jg. 19 H. 2, S. 146-1581971Spreading of sets in product spaces and hypercontraction of the Markov operator
Ahlswede, Rudolf ; Gács, PeterIn: The annals of probability, Jg. 4 H. 6, S. 925-9391976