- vom 14.7.2021
Two-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-101994Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
Ahlswede, Rudolf ; Cai, NingIn: IEEE transactions on information theory, Jg. 37 H. 6, S. 1647-16491991To 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-4081981The weak capacity of averaged channels
Ahlswede, RudolfIn: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 11 H. 1, S. 61-731968The rate-distortion region for multiple descriptions without excess rate
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 31 H. 6, S. 721-7261985The number of values of combinatorial functions
Ahlswede, Rudolf ; Daykin, David E.In: Bulletin of the London Mathematical Society, Jg. 11 H. 1, S. 49-511979The maximal length of cloud-antichains
Ahlswede, Rudolf ; Khachatrian, Levon H.In: Discrete Mathematics, Jg. 131 H. 1-3, S. 9-151994The maximal error capacity of arbitrarily varying channels for constant list sizes
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 39 H. 4, S. 1416-14171993The capacity region of a channel with two senders and two receivers
Ahlswede, RudolfIn: The annals of probability, Jg. 2 H. 5, S. 805-8141974The capacity of a channel with arbitrarily varying channel probability functions and binary output
Ahlswede, Rudolf ; Wolfowitz, J.In: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 15 H. 3, S. 186-1941970The asymptotic behavior of diameters in the average
Ahlswede, Rudolf ; Althöfer, IngoIn: Journal of Combinatorial Theory, Series B, Jg. 61 H. 2, S. 167-1771994Spreading 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-9391976Source 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-6371975Simple hypergraphs with maximal number of adjacent pairs of edges
Ahlswede, RudolfIn: Journal of Combinatorial Theory, Series B, Jg. 28 H. 2, S. 164-1671980Rich colorings with local constraints
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Journal of combinatorics, information & system sciences, Jg. 17 H. 3, S. 203-2161992Reuseable 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-11501991Remarks on Shannon's secrecy systems
Ahlswede, RudolfIn: Problems of Control and Information Theory, Jg. 11 H. 4, S. 301-3181982Rank formulas for certain products of matrices
Ahlswede, Rudolf ; Cai, NingIn: Applicable Algebra in Engineering, Communication and Computing, Jg. 4 H. 4, S. 253-2611993Partitioning the n-cube into sets with mutual distance 1
Blokhuis, A. ; Metsch, K. ; Moorhouse, G. E. ; Ahlswede, Rudolf ; Bezrukov, S. L.In: Applied Mathematics Letters, Jg. 6 H. 4, S. 17-191993Optimal coding strategies for certain permuting channels
Ahlswede, Rudolf ; Kaspi, Amiram H.In: IEEE transactions on information theory, Jg. 33 H. 3, S. 310-3141987