Simple hypergraphs with maximal number of adjacent pairs of edges
Ahlswede, RudolfIn: Journal of Combinatorial Theory, Series B, Vol. 28 Issue 2, page 164-1671980The weak capacity of averaged channels
Ahlswede, RudolfIn: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Vol. 11 Issue 1, page 61-731968The asymptotic behavior of diameters in the average
Ahlswede, Rudolf ; Althöfer, IngoIn: Journal of Combinatorial Theory, Series B, Vol. 61 Issue 2, page 167-1771994Asymptotically dense nonbinary codes correcting a constant number of localized errors [Manuskript]
Ahlswede, Rudolf ; Bassalygo, L. A. ; Pinsker, M. S.In: Comptes rendus de l' Académie bulgare des Sciences, Vol. 46 Issue 1, page 35-371993Asymptotically optimal binary codes of polynomial complexity correcting localized errors
Ahlswede, Rudolf ; Bassalygo, L. A. ; Pinsker, M. S.In: Probl. Peredachi Inf., Vol. 31 Issue 2, page 76-831995Binary constant-weight codes correcting localized errors and defects
Ahlswede, Rudolf ; Bassalygo, L. A. ; Pinsker, M. S.In: Problems of information transmission, Vol. 30 Issue 2, page 102-1041994Nonbinary codes correcting localized errors
Ahlswede, Rudolf ; Bassalygo, L. A. ; Pinsker, M. S.In: IEEE transactions on information theory, Vol. 39 Issue 4, page 1413-14161993Approximation o continuous functions in p-Adic Analysis
Ahlswede, Rudolf ; Bojanic, R.In: Journal of Approximation Theory, Vol. 15 Issue 3, page 190-2051975On minimax estimation in the presence of side information about remote data
Ahlswede, Rudolf ; Burnashev, M. V.In: The annals of statistics, Vol. 18 Issue 1, page 141-1711990A generalization of the AZ identity
Ahlswede, Rudolf ; Cai, NingIn: Combinatorica, Vol. 13 Issue 3, page 241-2471993On communication complexity of vector-valued functions
Ahlswede, Rudolf ; Cai, NingIn: IEEE transactions on information theory, Vol. 40 Issue 6, page 2062-20671994On extremal set partitions in Cartesian product spaces
Ahlswede, Rudolf ; Cai, NingIn: Combinatorics, Probability & Computing, Vol. 2 Issue 2, page 211-2201993On partitioning and packing products with rectangles
Ahlswede, Rudolf ; Cai, NingIn: Combinatorics, Probability & Computing, Vol. 3 Issue 04, page 429-4341994Rank formulas for certain products of matrices
Ahlswede, Rudolf ; Cai, NingIn: Applicable Algebra in Engineering, Communication and Computing, Vol. 4 Issue 4, page 253-2611993Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
Ahlswede, Rudolf ; Cai, NingIn: IEEE transactions on information theory, Vol. 37 Issue 6, page 1647-16491991Two-way communication complexity of sum-type functions for one processor to be informed
Ahlswede, Rudolf ; Cai, NingIn: Problems of information transmission, Vol. 30 Issue 1, page 3-101994Communication complexity in lattices
Ahlswede, Rudolf ; Cai, Ning ; Tamm, UlrichIn: Applied Mathematics Letters, Vol. 6 Issue 6, page 53-581993Diametric theorems in sequence spaces
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Combinatorica, Vol. 12 Issue 1, page 1-171992A general 4-words inequality with consequences for 2-way communication complexity
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Advances in Applied Mathematics, Vol. 10 Issue 1, page 75-941989