An elementary proof of the strong converse theorem for the multiple-access channel
Ahlswede, RudolfIn: J. Combinatorics, Information and System Sciences, Jg. 7 H. 3, S. 216-2301982Arbitrarily varying channels with states sequence known to the sender
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 32 H. 5, S. 621-6291986Extremal properties of rate distortion functions
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 36 H. 1, S. 166-1711990Improvements of Winograd's result on computation in the presence of noise
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 30 H. 6, S. 872-8771984Jacob Wolfowitz (1910-1981)
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 28 H. 5, S. 687-6901982On code pairs with specified Hamming distances
Ahlswede, RudolfIn: Combinatorics, Jg. 52, S. 9-471987On multiple descriptions and team guessing
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 32 H. 4, S. 543-5491986The rate-distortion region for multiple descriptions without excess rate
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 31 H. 6, S. 721-7261985Remarks on Shannon's secrecy systems
Ahlswede, RudolfIn: Problems of Control and Information Theory, Jg. 11 H. 4, S. 301-3181982On minimax estimation in the presence of side information about remote data
Ahlswede, Rudolf ; Burnashev, M. V.In: The annals of statistics, Jg. 18 H. 1, S. 141-1711990A general 4-words inequality with consequences for 2-way communication complexity
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Advances in Applied Mathematics, Jg. 10 H. 1, S. 75-941989A recursive bound for the number of complete K-subgraphs of a graph
Ahlswede, Rudolf ; Cai, Ning ; Zhang, Zhen ; Bodendiek, Rainer (Hrsg.) ; Henn, Rudolf (Hrsg.)1990Hypothesis 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-4081981Bad codes are good ciphers
Ahlswede, Rudolf ; Dueck, GunterIn: Problems of Control and Information Theory, Jg. 11 H. 5, S. 337-3511982Good 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-51984