The rate-distortion region for multiple descriptions without excess rate
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 31 H. 6, S. 721-7261985A recursive bound for the number of complete K-subgraphs of a graph
Ahlswede, Rudolf ; Cai, Ning ; Zhang, Zhen ; Bodendiek, Rainer (Hrsg.) ; Henn, Rudolf (Hrsg.)1990Remarks on Shannon's secrecy systems
Ahlswede, RudolfIn: Problems of Control and Information Theory, Jg. 11 H. 4, S. 301-3181982Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory
Ahlswede, Rudolf ; Simonyi, GaborIn: IEEE transactions on information theory, Jg. 37 H. 4, S. 1143-11501991Rich colorings with local constraints
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Journal of combinatorics, information & system sciences, Jg. 17 H. 3, S. 203-2161992Simple hypergraphs with maximal number of adjacent pairs of edges
Ahlswede, RudolfIn: Journal of Combinatorial Theory, Series B, Jg. 28 H. 2, S. 164-1671980Source encoding with side information and a converse for degraded broadcast channels
Ahlswede, Rudolf ; Körner, JánosIn: IEEE transactions on information theory, Jg. IT-21 H. 6, S. 629-6371975Spreading 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-9391976The structure of capacity functions for compound channels
Ahlswede, Rudolf ; Wolfowitz, J. ; Behara, M. (Hrsg.)In: Probability and information theory, Jg. vol. 1: Proceedings of the international symposium at McMaster University, Canada, April 1968, S. 12-541969To 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-4081981Two contributions to information theory
Ahlswede, Rudolf ; Gács, Peter ; Csiszár, Imre (Hrsg.)In: Topics in information theory, Jg. 16, S. 17-401975Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
Ahlswede, Rudolf ; Cai, NingIn: IEEE transactions on information theory, Jg. 37 H. 6, S. 1647-16491991A two-family extremal problem in hamming space
Ahlswede, Rudolf ; El Gamal, Abbas ; Pang, King F.In: Discrete Mathematics, Jg. 49 H. 1, S. 1-51984Two-way communication complexity of sum-type functions for one processor to be informed
Ahlswede, Rudolf ; Cai, NingIn: Problems of information transmission, Jg. 30 H. 1, S. 3-101994The weak capacity of averaged channels
Ahlswede, RudolfIn: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 11 H. 1, S. 61-731968